./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 b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:18:40,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:18:40,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:18:40,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:18:40,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:18:40,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:18:40,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:18:40,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:18:40,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:18:40,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:18:40,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:18:40,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:18:40,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:18:40,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:18:40,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:18:40,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:18:40,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:18:40,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:18:40,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:18:40,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:18:40,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:18:40,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:18:40,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:18:40,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:18:40,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:18:40,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:18:40,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:18:40,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:18:40,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:18:40,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:18:40,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:18:40,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:18:40,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:18:40,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:18:40,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:18:40,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:18:40,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:18:40,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:18:40,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:18:40,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:18:40,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:18:40,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:18:40,768 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:18:40,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:18:40,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:18:40,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:18:40,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:18:40,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:18:40,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:18:40,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:18:40,773 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:18:40,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:18:40,774 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:18:40,774 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:18:40,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:18:40,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:18:40,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:18:40,775 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:18:40,775 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:18:40,775 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:18:40,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:18:40,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:18:40,776 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:18:40,776 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:18:40,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:18:40,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:18:40,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:18:40,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:18:40,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:18:40,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:18:40,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:18:40,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:18:40,778 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:18:40,778 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:18:40,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:18:40,778 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:18:40,779 INFO L138 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2023-02-16 03:18:41,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:18:41,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:18:41,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:18:41,083 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:18:41,083 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:18:41,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-02-16 03:18:42,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:18:42,501 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:18:42,502 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-02-16 03:18:42,510 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a7f3424/6421cb6065be46999e4e187d3cb28758/FLAG880746f48 [2023-02-16 03:18:42,520 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a7f3424/6421cb6065be46999e4e187d3cb28758 [2023-02-16 03:18:42,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:18:42,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:18:42,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:18:42,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:18:42,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:18:42,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:18:42" (1/1) ... [2023-02-16 03:18:42,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b51a218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:42, skipping insertion in model container [2023-02-16 03:18:42,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:18:42" (1/1) ... [2023-02-16 03:18:42,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:18:42,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:18:42,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:18:42,896 ERROR L326 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-02-16 03:18:42,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ca1b497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:42, skipping insertion in model container [2023-02-16 03:18:42,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:18:42,899 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:18:42,901 INFO L158 Benchmark]: Toolchain (without parser) took 376.95ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 106.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:18:42,902 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:18:42,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.18ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 106.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:18:42,904 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.18ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 106.5MB in the end (delta: 12.5MB). 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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:18:44,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:18:44,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:18:44,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:18:44,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:18:44,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:18:44,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:18:44,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:18:44,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:18:44,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:18:44,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:18:44,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:18:44,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:18:44,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:18:44,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:18:44,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:18:44,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:18:44,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:18:44,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:18:44,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:18:44,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:18:44,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:18:44,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:18:44,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:18:44,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:18:44,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:18:44,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:18:44,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:18:44,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:18:44,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:18:44,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:18:44,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:18:44,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:18:44,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:18:44,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:18:44,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:18:44,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:18:44,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:18:44,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:18:44,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:18:44,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:18:44,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:18:44,998 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:18:45,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:18:45,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:18:45,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:18:45,003 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:18:45,003 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:18:45,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:18:45,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:18:45,004 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:18:45,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:18:45,005 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:18:45,005 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:18:45,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:18:45,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:18:45,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:18:45,006 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:18:45,006 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:18:45,006 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:18:45,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:18:45,007 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:18:45,007 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:18:45,007 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:18:45,007 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:18:45,007 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:18:45,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:18:45,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:18:45,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:18:45,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:18:45,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:18:45,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:18:45,009 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:18:45,009 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:18:45,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:18:45,009 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:18:45,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:18:45,010 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:18:45,010 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:18:45,010 INFO L138 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2023-02-16 03:18:45,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:18:45,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:18:45,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:18:45,332 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:18:45,332 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:18:45,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-02-16 03:18:46,541 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:18:46,814 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:18:46,815 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-02-16 03:18:46,827 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec0a3646/278ab272947343558501051726a9ff68/FLAG0a9f4b77e [2023-02-16 03:18:46,841 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec0a3646/278ab272947343558501051726a9ff68 [2023-02-16 03:18:46,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:18:46,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:18:46,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:18:46,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:18:46,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:18:46,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:18:46" (1/1) ... [2023-02-16 03:18:46,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff809d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:46, skipping insertion in model container [2023-02-16 03:18:46,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:18:46" (1/1) ... [2023-02-16 03:18:46,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:18:46,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:18:47,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:18:47,234 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:18:47,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:18:47,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:18:47,298 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:18:47,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:18:47,378 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:18:47,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47 WrapperNode [2023-02-16 03:18:47,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:18:47,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:18:47,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:18:47,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:18:47,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,446 INFO L138 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2023-02-16 03:18:47,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:18:47,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:18:47,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:18:47,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:18:47,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,496 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:18:47,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:18:47,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:18:47,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:18:47,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (1/1) ... [2023-02-16 03:18:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:18:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:18:47,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:18:47,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:18:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:18:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:18:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:18:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:18:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:18:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:18:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:18:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:18:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:18:47,686 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:18:47,688 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:18:48,344 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:18:48,350 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:18:48,351 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 03:18:48,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:18:48 BoogieIcfgContainer [2023-02-16 03:18:48,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:18:48,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:18:48,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:18:48,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:18:48,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:18:46" (1/3) ... [2023-02-16 03:18:48,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e75d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:18:48, skipping insertion in model container [2023-02-16 03:18:48,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:18:47" (2/3) ... [2023-02-16 03:18:48,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e75d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:18:48, skipping insertion in model container [2023-02-16 03:18:48,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:18:48" (3/3) ... [2023-02-16 03:18:48,360 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2023-02-16 03:18:48,374 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:18:48,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2023-02-16 03:18:48,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:18:48,417 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;@9493677, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:18:48,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-02-16 03:18:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 77 states have (on average 2.207792207792208) internal successors, (170), 154 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-02-16 03:18:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:18:48,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:48,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:18:48,427 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-02-16 03:18:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:18:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:48,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696468987] [2023-02-16 03:18:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:48,442 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-02-16 03:18:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:48,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:48,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:48,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:18:48,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:48,594 INFO L350 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-02-16 03:18:48,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-02-16 03:18:48,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:48,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696468987] [2023-02-16 03:18:48,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696468987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:48,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:48,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:18:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577009984] [2023-02-16 03:18:48,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:48,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:18:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:18:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:18:48,652 INFO L87 Difference]: Start difference. First operand has 155 states, 77 states have (on average 2.207792207792208) internal successors, (170), 154 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:48,923 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2023-02-16 03:18:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:18:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:18:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:48,934 INFO L225 Difference]: With dead ends: 169 [2023-02-16 03:18:48,935 INFO L226 Difference]: Without dead ends: 167 [2023-02-16 03:18:48,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:18:48,941 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:48,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 127 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:18:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-16 03:18:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2023-02-16 03:18:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 76 states have (on average 2.1315789473684212) internal successors, (162), 150 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2023-02-16 03:18:49,000 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2023-02-16 03:18:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:49,000 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2023-02-16 03:18:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2023-02-16 03:18:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:18:49,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:49,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:18:49,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,210 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-02-16 03:18:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:18:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:49,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911726722] [2023-02-16 03:18:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:49,212 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-02-16 03:18:49,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:49,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:49,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:18:49,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:49,278 INFO L350 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-02-16 03:18:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:49,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:49,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:49,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911726722] [2023-02-16 03:18:49,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911726722] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:49,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:49,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:18:49,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688547513] [2023-02-16 03:18:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:49,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:18:49,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:49,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:18:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:18:49,292 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:49,540 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2023-02-16 03:18:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:18:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:18:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:49,542 INFO L225 Difference]: With dead ends: 149 [2023-02-16 03:18:49,542 INFO L226 Difference]: Without dead ends: 149 [2023-02-16 03:18:49,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:18:49,544 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 83 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.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:49,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 83 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:18:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-16 03:18:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-02-16 03:18:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2023-02-16 03:18:49,551 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 3 [2023-02-16 03:18:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:49,551 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2023-02-16 03:18:49,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2023-02-16 03:18:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:18:49,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:49,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:18:49,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:49,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,764 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-02-16 03:18:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2023-02-16 03:18:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:49,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529113010] [2023-02-16 03:18:49,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:49,765 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-02-16 03:18:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:49,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:49,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:18:49,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:49,845 INFO L350 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-02-16 03:18:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:49,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:49,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:49,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529113010] [2023-02-16 03:18:49,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529113010] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:49,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:49,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:18:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986588035] [2023-02-16 03:18:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:49,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:18:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:18:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:18:49,870 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-16 03:18:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:50,237 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2023-02-16 03:18:50,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:18:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-16 03:18:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:50,239 INFO L225 Difference]: With dead ends: 159 [2023-02-16 03:18:50,239 INFO L226 Difference]: Without dead ends: 159 [2023-02-16 03:18:50,239 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-02-16 03:18:50,240 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 206 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:50,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 91 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:18:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-16 03:18:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2023-02-16 03:18:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 133 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2023-02-16 03:18:50,247 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 6 [2023-02-16 03:18:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:50,247 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2023-02-16 03:18:50,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-16 03:18:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2023-02-16 03:18:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:18:50,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:50,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:18:50,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:50,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:50,457 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-02-16 03:18:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2023-02-16 03:18:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:50,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77908038] [2023-02-16 03:18:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:50,459 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-02-16 03:18:50,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:50,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:50,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:50,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:18:50,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:50,539 INFO L350 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-02-16 03:18:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:50,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:50,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77908038] [2023-02-16 03:18:50,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77908038] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:50,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:50,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:18:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468021005] [2023-02-16 03:18:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:50,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:18:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:18:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:18:50,576 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-16 03:18:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:51,075 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2023-02-16 03:18:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:18:51,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-16 03:18:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:51,079 INFO L225 Difference]: With dead ends: 185 [2023-02-16 03:18:51,079 INFO L226 Difference]: Without dead ends: 185 [2023-02-16 03:18:51,080 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-02-16 03:18:51,080 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 242 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:51,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 110 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:18:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-16 03:18:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2023-02-16 03:18:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.709090909090909) internal successors, (188), 164 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2023-02-16 03:18:51,088 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 6 [2023-02-16 03:18:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:51,088 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2023-02-16 03:18:51,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-16 03:18:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2023-02-16 03:18:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:18:51,089 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:51,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:51,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:51,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:51,289 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-02-16 03:18:51,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826674, now seen corresponding path program 1 times [2023-02-16 03:18:51,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:51,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801632607] [2023-02-16 03:18:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:51,291 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-02-16 03:18:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:51,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:51,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:51,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:18:51,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:51,356 INFO L350 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-02-16 03:18:51,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:18:51,380 INFO L350 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-02-16 03:18:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:51,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:51,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:51,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801632607] [2023-02-16 03:18:51,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801632607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:51,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:51,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:18:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684227096] [2023-02-16 03:18:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:51,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:18:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:18:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:18:51,391 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-02-16 03:18:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:51,675 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2023-02-16 03:18:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:18:51,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-02-16 03:18:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:51,676 INFO L225 Difference]: With dead ends: 182 [2023-02-16 03:18:51,676 INFO L226 Difference]: Without dead ends: 182 [2023-02-16 03:18:51,677 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-02-16 03:18:51,677 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 113 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:51,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 175 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:18:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-16 03:18:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2023-02-16 03:18:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.7) internal successors, (187), 164 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2023-02-16 03:18:51,683 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 9 [2023-02-16 03:18:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:51,683 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2023-02-16 03:18:51,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-02-16 03:18:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2023-02-16 03:18:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:18:51,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:51,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:51,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:51,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:51,900 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-02-16 03:18:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2023-02-16 03:18:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:51,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354253196] [2023-02-16 03:18:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:51,904 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-02-16 03:18:51,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:51,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:51,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:51,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:18:51,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:51,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:51,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:51,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354253196] [2023-02-16 03:18:51,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354253196] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:51,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:51,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:18:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983491018] [2023-02-16 03:18:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:18:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:18:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:18:51,983 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:51,991 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2023-02-16 03:18:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:18:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-16 03:18:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:51,992 INFO L225 Difference]: With dead ends: 167 [2023-02-16 03:18:51,992 INFO L226 Difference]: Without dead ends: 167 [2023-02-16 03:18:51,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-02-16 03:18:51,993 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:51,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:18:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-16 03:18:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-02-16 03:18:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.6875) internal successors, (189), 166 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-02-16 03:18:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2023-02-16 03:18:51,998 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 13 [2023-02-16 03:18:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:51,998 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2023-02-16 03:18:51,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2023-02-16 03:18:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:18:51,999 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:52,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:52,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:52,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:52,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:52,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 131239230, now seen corresponding path program 1 times [2023-02-16 03:18:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:52,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130072165] [2023-02-16 03:18:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:52,211 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-02-16 03:18:52,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:52,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:52,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:52,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:18:52,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:52,302 INFO L350 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-02-16 03:18:52,316 INFO L350 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-02-16 03:18:52,333 INFO L350 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-02-16 03:18:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:52,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:52,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:52,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130072165] [2023-02-16 03:18:52,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130072165] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:52,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:52,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:18:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943775235] [2023-02-16 03:18:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:52,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:18:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:52,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:18:52,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:18:52,349 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:52,722 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2023-02-16 03:18:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:18:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 03:18:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:52,727 INFO L225 Difference]: With dead ends: 166 [2023-02-16 03:18:52,727 INFO L226 Difference]: Without dead ends: 166 [2023-02-16 03:18:52,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:18:52,728 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:52,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 328 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:18:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-16 03:18:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-02-16 03:18:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 112 states have (on average 1.6696428571428572) internal successors, (187), 165 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2023-02-16 03:18:52,731 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 15 [2023-02-16 03:18:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:52,731 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2023-02-16 03:18:52,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2023-02-16 03:18:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:18:52,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:52,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:52,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:52,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash 131239231, now seen corresponding path program 1 times [2023-02-16 03:18:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:52,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091562070] [2023-02-16 03:18:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:52,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:18:52,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:52,936 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:52,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:53,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:18:53,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:53,056 INFO L350 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-02-16 03:18:53,074 INFO L350 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-02-16 03:18:53,088 INFO L350 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-02-16 03:18:53,111 INFO L350 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-02-16 03:18:53,116 INFO L350 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-02-16 03:18:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:53,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:53,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:53,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091562070] [2023-02-16 03:18:53,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091562070] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:53,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:53,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:18:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358125307] [2023-02-16 03:18:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:53,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:18:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:18:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:18:53,129 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:53,545 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2023-02-16 03:18:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:18:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 03:18:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:53,550 INFO L225 Difference]: With dead ends: 165 [2023-02-16 03:18:53,550 INFO L226 Difference]: Without dead ends: 165 [2023-02-16 03:18:53,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:18:53,551 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:53,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 310 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:18:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-16 03:18:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-02-16 03:18:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 164 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2023-02-16 03:18:53,554 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 15 [2023-02-16 03:18:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:53,554 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2023-02-16 03:18:53,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2023-02-16 03:18:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:18:53,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:53,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:53,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:53,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:53,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2023-02-16 03:18:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245676816] [2023-02-16 03:18:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:53,757 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-02-16 03:18:53,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:53,759 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:53,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:53,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:18:53,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:53,830 INFO L350 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-02-16 03:18:53,835 INFO L350 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-02-16 03:18:53,888 INFO L350 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 7 [2023-02-16 03:18:53,892 INFO L350 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 7 [2023-02-16 03:18:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:53,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:53,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245676816] [2023-02-16 03:18:53,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245676816] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:53,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:53,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:18:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278334689] [2023-02-16 03:18:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:53,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:18:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:53,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:18:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:18:53,916 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:54,380 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2023-02-16 03:18:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:18:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 03:18:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:54,382 INFO L225 Difference]: With dead ends: 203 [2023-02-16 03:18:54,382 INFO L226 Difference]: Without dead ends: 203 [2023-02-16 03:18:54,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:18:54,383 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 48 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:54,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 523 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:18:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-16 03:18:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2023-02-16 03:18:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 123 states have (on average 1.6260162601626016) internal successors, (200), 175 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-02-16 03:18:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2023-02-16 03:18:54,387 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 15 [2023-02-16 03:18:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:54,387 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2023-02-16 03:18:54,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2023-02-16 03:18:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:18:54,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:54,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:54,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:54,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:54,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751881, now seen corresponding path program 1 times [2023-02-16 03:18:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:54,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704264636] [2023-02-16 03:18:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:54,594 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-02-16 03:18:54,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:54,596 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:54,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:54,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:18:54,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:54,679 INFO L350 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-02-16 03:18:54,688 INFO L350 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-02-16 03:18:54,706 INFO L350 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-02-16 03:18:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:54,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:54,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:54,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704264636] [2023-02-16 03:18:54,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704264636] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:54,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:54,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:18:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991398744] [2023-02-16 03:18:54,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:54,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:18:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:18:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:18:54,717 INFO L87 Difference]: Start difference. First operand 176 states and 200 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-02-16 03:18:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:55,088 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2023-02-16 03:18:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:18:55,089 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-02-16 03:18:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:55,089 INFO L225 Difference]: With dead ends: 175 [2023-02-16 03:18:55,090 INFO L226 Difference]: Without dead ends: 175 [2023-02-16 03:18:55,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:18:55,090 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 7 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:55,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 323 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:18:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-16 03:18:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-16 03:18:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 123 states have (on average 1.6097560975609757) internal successors, (198), 174 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-02-16 03:18:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2023-02-16 03:18:55,094 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 17 [2023-02-16 03:18:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:55,094 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2023-02-16 03:18:55,094 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-02-16 03:18:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2023-02-16 03:18:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:18:55,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:55,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:55,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:55,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:55,295 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751880, now seen corresponding path program 1 times [2023-02-16 03:18:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050245404] [2023-02-16 03:18:55,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:55,297 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-02-16 03:18:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:55,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:55,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:55,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:18:55,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:55,385 INFO L350 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-02-16 03:18:55,413 INFO L350 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-02-16 03:18:55,420 INFO L350 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-02-16 03:18:55,454 INFO L350 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-02-16 03:18:55,462 INFO L350 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 7 [2023-02-16 03:18:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:55,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:55,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:55,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050245404] [2023-02-16 03:18:55,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050245404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:55,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:55,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:18:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418462191] [2023-02-16 03:18:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:55,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:18:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:18:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:18:55,476 INFO L87 Difference]: Start difference. First operand 175 states and 198 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-02-16 03:18:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:55,872 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2023-02-16 03:18:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:18:55,873 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-02-16 03:18:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:55,874 INFO L225 Difference]: With dead ends: 174 [2023-02-16 03:18:55,874 INFO L226 Difference]: Without dead ends: 174 [2023-02-16 03:18:55,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-02-16 03:18:55,875 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:55,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 305 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:18:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-16 03:18:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-02-16 03:18:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.5934959349593496) internal successors, (196), 173 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2023-02-16 03:18:55,878 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 17 [2023-02-16 03:18:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:55,879 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2023-02-16 03:18:55,879 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-02-16 03:18:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2023-02-16 03:18:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:18:55,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:55,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:55,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:56,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:56,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1696190880, now seen corresponding path program 1 times [2023-02-16 03:18:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:56,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551180481] [2023-02-16 03:18:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:56,091 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-02-16 03:18:56,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:56,092 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:56,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:56,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:18:56,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:56,189 INFO L350 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-02-16 03:18:56,193 INFO L350 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-02-16 03:18:56,206 INFO L350 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-02-16 03:18:56,212 INFO L350 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-02-16 03:18:56,246 INFO L350 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-02-16 03:18:56,254 INFO L350 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-02-16 03:18:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:56,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:56,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551180481] [2023-02-16 03:18:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551180481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:56,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:18:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622394143] [2023-02-16 03:18:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:18:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:18:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:18:56,311 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-02-16 03:18:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:56,724 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2023-02-16 03:18:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:18:56,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-02-16 03:18:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:56,728 INFO L225 Difference]: With dead ends: 287 [2023-02-16 03:18:56,728 INFO L226 Difference]: Without dead ends: 287 [2023-02-16 03:18:56,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:18:56,729 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:56,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 588 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:18:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-16 03:18:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 184. [2023-02-16 03:18:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2023-02-16 03:18:56,733 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 17 [2023-02-16 03:18:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:56,733 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2023-02-16 03:18:56,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-02-16 03:18:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2023-02-16 03:18:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:18:56,734 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:56,734 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:56,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:56,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:56,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188958, now seen corresponding path program 1 times [2023-02-16 03:18:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:56,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024409826] [2023-02-16 03:18:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:56,945 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-02-16 03:18:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:56,946 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:56,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:57,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:18:57,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:57,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:57,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:57,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024409826] [2023-02-16 03:18:57,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024409826] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:57,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:57,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:18:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936402722] [2023-02-16 03:18:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:57,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:18:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:18:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:18:57,055 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-16 03:18:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:57,396 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2023-02-16 03:18:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:18:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-16 03:18:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:57,397 INFO L225 Difference]: With dead ends: 225 [2023-02-16 03:18:57,397 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 03:18:57,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-02-16 03:18:57,399 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 132 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:57,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 166 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:18:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 03:18:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2023-02-16 03:18:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 185 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2023-02-16 03:18:57,403 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 17 [2023-02-16 03:18:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:57,404 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2023-02-16 03:18:57,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-16 03:18:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2023-02-16 03:18:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:18:57,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:57,405 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:57,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:57,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188959, now seen corresponding path program 1 times [2023-02-16 03:18:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:57,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466693914] [2023-02-16 03:18:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:57,616 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-02-16 03:18:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:57,617 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:57,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:57,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:18:57,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:57,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:57,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:57,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466693914] [2023-02-16 03:18:57,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466693914] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:57,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:57,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:18:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592007446] [2023-02-16 03:18:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:18:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:18:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:18:57,766 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.4) 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-02-16 03:18:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:58,299 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2023-02-16 03:18:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:18:58,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) 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 17 [2023-02-16 03:18:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:58,301 INFO L225 Difference]: With dead ends: 302 [2023-02-16 03:18:58,301 INFO L226 Difference]: Without dead ends: 302 [2023-02-16 03:18:58,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:18:58,301 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 407 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:58,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 306 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:18:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-02-16 03:18:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 189. [2023-02-16 03:18:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.5579710144927537) internal successors, (215), 188 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2023-02-16 03:18:58,306 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 17 [2023-02-16 03:18:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:58,306 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2023-02-16 03:18:58,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) 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-02-16 03:18:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2023-02-16 03:18:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:18:58,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:58,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:58,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:18:58,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:58,513 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-02-16 03:18:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705298, now seen corresponding path program 1 times [2023-02-16 03:18:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:58,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808228587] [2023-02-16 03:18:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:58,514 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-02-16 03:18:58,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:58,515 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:58,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:58,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:18:58,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:58,624 INFO L350 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-02-16 03:18:58,649 INFO L350 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-02-16 03:18:58,658 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:18:58,659 INFO L350 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-02-16 03:18:58,694 INFO L350 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-02-16 03:18:58,702 INFO L350 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 11 treesize of output 7 [2023-02-16 03:18:58,771 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:18:58,772 INFO L350 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 38 treesize of output 37 [2023-02-16 03:18:58,791 INFO L350 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 18 treesize of output 20 [2023-02-16 03:18:58,816 INFO L350 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-02-16 03:18:58,826 INFO L350 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 15 treesize of output 7 [2023-02-16 03:18:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:58,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:18:58,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:18:58,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808228587] [2023-02-16 03:18:58,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808228587] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:18:58,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:18:58,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:18:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725159966] [2023-02-16 03:18:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:18:58,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:18:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:18:58,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:18:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:18:58,847 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:18:59,576 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2023-02-16 03:18:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:18:59,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-02-16 03:18:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:18:59,578 INFO L225 Difference]: With dead ends: 207 [2023-02-16 03:18:59,578 INFO L226 Difference]: Without dead ends: 207 [2023-02-16 03:18:59,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:18:59,579 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 183 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:18:59,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 195 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:18:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-16 03:18:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2023-02-16 03:18:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 187 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2023-02-16 03:18:59,583 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 18 [2023-02-16 03:18:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:18:59,584 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2023-02-16 03:18:59,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2023-02-16 03:18:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:18:59,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:18:59,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:18:59,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:59,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:59,795 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:18:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:18:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705297, now seen corresponding path program 1 times [2023-02-16 03:18:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:18:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112737507] [2023-02-16 03:18:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:18:59,796 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-02-16 03:18:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:18:59,797 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:59,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:18:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:18:59,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:18:59,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:18:59,908 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:18:59,909 INFO L350 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-02-16 03:19:00,001 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-02-16 03:19:00,003 INFO L350 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-02-16 03:19:00,051 INFO L350 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 11 treesize of output 7 [2023-02-16 03:19:00,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:00,150 INFO L350 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 46 treesize of output 45 [2023-02-16 03:19:00,185 INFO L350 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-02-16 03:19:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:00,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:00,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:00,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112737507] [2023-02-16 03:19:00,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112737507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:00,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:00,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:19:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627268179] [2023-02-16 03:19:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:00,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:19:00,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:19:00,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:19:00,246 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:01,134 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2023-02-16 03:19:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:19:01,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-02-16 03:19:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:01,136 INFO L225 Difference]: With dead ends: 206 [2023-02-16 03:19:01,136 INFO L226 Difference]: Without dead ends: 206 [2023-02-16 03:19:01,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:19:01,136 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 320 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:01,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 220 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:19:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-16 03:19:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2023-02-16 03:19:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 138 states have (on average 1.5217391304347827) internal successors, (210), 186 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2023-02-16 03:19:01,140 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 18 [2023-02-16 03:19:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:01,140 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2023-02-16 03:19:01,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2023-02-16 03:19:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:19:01,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:01,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:01,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:01,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:01,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:19:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1042249152, now seen corresponding path program 1 times [2023-02-16 03:19:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:01,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330980239] [2023-02-16 03:19:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:01,343 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-02-16 03:19:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:01,344 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:01,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:01,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:19:01,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:01,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:01,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:01,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330980239] [2023-02-16 03:19:01,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330980239] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:19:01,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:19:01,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-16 03:19:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426491913] [2023-02-16 03:19:01,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:19:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:19:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:19:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:19:01,518 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:01,911 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2023-02-16 03:19:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:19:01,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-16 03:19:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:01,913 INFO L225 Difference]: With dead ends: 264 [2023-02-16 03:19:01,913 INFO L226 Difference]: Without dead ends: 264 [2023-02-16 03:19:01,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:19:01,914 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 311 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:01,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 467 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:19:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-02-16 03:19:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 186. [2023-02-16 03:19:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2023-02-16 03:19:01,918 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 18 [2023-02-16 03:19:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:01,918 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2023-02-16 03:19:01,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2023-02-16 03:19:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:19:01,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:01,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:01,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:02,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:02,129 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-02-16 03:19:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350413, now seen corresponding path program 1 times [2023-02-16 03:19:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:02,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574735157] [2023-02-16 03:19:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:02,130 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-02-16 03:19:02,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:02,131 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:02,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:02,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:19:02,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:02,246 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:19:02,247 INFO L350 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-02-16 03:19:02,352 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-02-16 03:19:02,354 INFO L350 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-02-16 03:19:02,400 INFO L350 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 13 treesize of output 9 [2023-02-16 03:19:02,505 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:02,505 INFO L350 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 54 treesize of output 53 [2023-02-16 03:19:02,541 INFO L350 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-02-16 03:19:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:02,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:02,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:02,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574735157] [2023-02-16 03:19:02,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574735157] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:02,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:02,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:19:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439570448] [2023-02-16 03:19:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:02,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:19:02,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:19:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:19:02,588 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:03,528 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2023-02-16 03:19:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:19:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 03:19:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:03,529 INFO L225 Difference]: With dead ends: 205 [2023-02-16 03:19:03,529 INFO L226 Difference]: Without dead ends: 205 [2023-02-16 03:19:03,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:19:03,530 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 317 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:03,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 254 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:19:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-16 03:19:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2023-02-16 03:19:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 137 states have (on average 1.510948905109489) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2023-02-16 03:19:03,534 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 20 [2023-02-16 03:19:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:03,534 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2023-02-16 03:19:03,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2023-02-16 03:19:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:19:03,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:03,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:03,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:03,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:03,744 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-02-16 03:19:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350412, now seen corresponding path program 1 times [2023-02-16 03:19:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:03,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177741561] [2023-02-16 03:19:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:03,745 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-02-16 03:19:03,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:03,746 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:03,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:03,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:19:03,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:03,850 INFO L350 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-02-16 03:19:03,879 INFO L350 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-02-16 03:19:03,889 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:19:03,890 INFO L350 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-02-16 03:19:03,911 INFO L350 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-02-16 03:19:03,917 INFO L350 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 13 treesize of output 9 [2023-02-16 03:19:03,991 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:03,991 INFO L350 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 46 treesize of output 45 [2023-02-16 03:19:03,999 INFO L350 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 22 treesize of output 24 [2023-02-16 03:19:04,013 INFO L350 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-02-16 03:19:04,022 INFO L350 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 19 treesize of output 7 [2023-02-16 03:19:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:04,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:04,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177741561] [2023-02-16 03:19:04,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177741561] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:04,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:04,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:19:04,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990027640] [2023-02-16 03:19:04,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:04,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:19:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:04,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:19:04,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:19:04,042 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:04,730 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2023-02-16 03:19:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:19:04,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 03:19:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:04,731 INFO L225 Difference]: With dead ends: 204 [2023-02-16 03:19:04,731 INFO L226 Difference]: Without dead ends: 204 [2023-02-16 03:19:04,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:19:04,732 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 172 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:04,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 194 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:19:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-16 03:19:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2023-02-16 03:19:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2023-02-16 03:19:04,736 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 20 [2023-02-16 03:19:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:04,736 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2023-02-16 03:19:04,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2023-02-16 03:19:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:19:04,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:04,736 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:04,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:04,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:04,945 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-02-16 03:19:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1776483090, now seen corresponding path program 1 times [2023-02-16 03:19:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:04,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818492440] [2023-02-16 03:19:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:04,946 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-02-16 03:19:04,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:04,947 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:04,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:05,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-16 03:19:05,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:05,071 INFO L350 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-02-16 03:19:05,075 INFO L350 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-02-16 03:19:05,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:19:05,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:19:05,167 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2023-02-16 03:19:05,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2023-02-16 03:19:05,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:19:05,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:19:05,175 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-02-16 03:19:05,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:19:05,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:05,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2023-02-16 03:19:05,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:19:05,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2023-02-16 03:19:05,279 INFO L350 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-02-16 03:19:05,281 INFO L350 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-02-16 03:19:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:05,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:05,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818492440] [2023-02-16 03:19:05,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818492440] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:19:05,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:19:05,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2023-02-16 03:19:05,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766368082] [2023-02-16 03:19:05,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:19:05,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:19:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:19:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:19:05,514 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:06,729 INFO L93 Difference]: Finished difference Result 295 states and 332 transitions. [2023-02-16 03:19:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:19:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 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-02-16 03:19:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:06,731 INFO L225 Difference]: With dead ends: 295 [2023-02-16 03:19:06,731 INFO L226 Difference]: Without dead ends: 295 [2023-02-16 03:19:06,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2023-02-16 03:19:06,732 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 307 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:06,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1232 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 03:19:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-16 03:19:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 242. [2023-02-16 03:19:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.4512820512820512) internal successors, (283), 241 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 283 transitions. [2023-02-16 03:19:06,738 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 283 transitions. Word has length 26 [2023-02-16 03:19:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:06,738 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 283 transitions. [2023-02-16 03:19:06,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 283 transitions. [2023-02-16 03:19:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:19:06,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:06,739 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] [2023-02-16 03:19:06,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:06,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:06,941 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:19:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719994, now seen corresponding path program 1 times [2023-02-16 03:19:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:06,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645249497] [2023-02-16 03:19:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:06,942 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-02-16 03:19:06,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:06,943 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:06,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:19:07,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:07,056 INFO L350 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-02-16 03:19:07,151 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:19:07,152 INFO L350 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-02-16 03:19:07,179 INFO L350 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 13 treesize of output 9 [2023-02-16 03:19:07,274 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:07,275 INFO L350 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 37 [2023-02-16 03:19:07,345 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:07,345 INFO L350 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 37 [2023-02-16 03:19:07,454 INFO L350 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-02-16 03:19:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:07,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:09,638 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_539) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:19:09,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_538))) (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_539)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:19:09,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_538))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_539))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:19:09,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:09,696 INFO L350 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-02-16 03:19:09,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:09,715 INFO L350 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-02-16 03:19:09,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 236 [2023-02-16 03:19:09,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:09,739 INFO L350 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 236 treesize of output 212 [2023-02-16 03:19:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:27,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:27,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645249497] [2023-02-16 03:19:27,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645249497] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:19:27,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:19:27,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-02-16 03:19:27,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858162280] [2023-02-16 03:19:27,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:19:27,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 03:19:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 03:19:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=295, Unknown=7, NotChecked=114, Total=506 [2023-02-16 03:19:27,694 INFO L87 Difference]: Start difference. First operand 242 states and 283 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:53,576 INFO L93 Difference]: Finished difference Result 388 states and 460 transitions. [2023-02-16 03:19:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:19:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-16 03:19:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:53,578 INFO L225 Difference]: With dead ends: 388 [2023-02-16 03:19:53,578 INFO L226 Difference]: Without dead ends: 388 [2023-02-16 03:19:53,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=249, Invalid=615, Unknown=18, NotChecked=174, Total=1056 [2023-02-16 03:19:53,579 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 422 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:53,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 690 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1227 Invalid, 0 Unknown, 598 Unchecked, 2.3s Time] [2023-02-16 03:19:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-02-16 03:19:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 277. [2023-02-16 03:19:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 276 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 337 transitions. [2023-02-16 03:19:53,584 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 337 transitions. Word has length 32 [2023-02-16 03:19:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:53,585 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 337 transitions. [2023-02-16 03:19:53,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:19:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 337 transitions. [2023-02-16 03:19:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:19:53,586 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:53,586 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] [2023-02-16 03:19:53,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:53,787 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-02-16 03:19:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719993, now seen corresponding path program 1 times [2023-02-16 03:19:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:53,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309441284] [2023-02-16 03:19:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:53,788 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-02-16 03:19:53,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:53,789 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:53,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-02-16 03:19:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:53,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:19:53,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:53,955 INFO L350 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-02-16 03:19:54,084 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:19:54,084 INFO L350 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-02-16 03:19:54,093 INFO L350 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-02-16 03:19:54,137 INFO L350 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 13 treesize of output 9 [2023-02-16 03:19:54,151 INFO L350 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-02-16 03:19:54,293 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:54,293 INFO L350 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 46 treesize of output 45 [2023-02-16 03:19:54,309 INFO L350 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 22 treesize of output 24 [2023-02-16 03:19:54,409 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:54,409 INFO L350 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 46 treesize of output 45 [2023-02-16 03:19:54,418 INFO L350 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 22 treesize of output 24 [2023-02-16 03:19:54,572 INFO L350 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-02-16 03:19:54,582 INFO L350 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 15 treesize of output 7 [2023-02-16 03:19:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:54,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:54,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) is different from false [2023-02-16 03:19:55,014 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) is different from false [2023-02-16 03:19:55,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32))) (.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_580))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_581) .cse3 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) is different from false [2023-02-16 03:19:55,169 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~root~0#1.offset| (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_580))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) .cse4 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3) (_ bv4 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))))))) is different from false [2023-02-16 03:19:55,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:55,212 INFO L350 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-02-16 03:19:55,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:55,223 INFO L350 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 79 treesize of output 60 [2023-02-16 03:19:55,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:55,252 INFO L350 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 400 treesize of output 345 [2023-02-16 03:19:55,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:55,285 INFO L350 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 724 treesize of output 681 [2023-02-16 03:19:55,293 INFO L350 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 666 treesize of output 618 [2023-02-16 03:19:55,299 INFO L350 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 618 treesize of output 602 [2023-02-16 03:19:55,310 INFO L350 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 602 treesize of output 554 [2023-02-16 03:19:55,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:55,335 INFO L350 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 554 treesize of output 458 [2023-02-16 03:22:48,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:22:48,674 INFO L350 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-02-16 03:22:48,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:22:48,685 INFO L350 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-02-16 03:22:48,693 INFO L350 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-02-16 03:22:48,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:22:48,720 INFO L350 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-02-16 03:22:48,726 INFO L350 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 220 treesize of output 180 [2023-02-16 03:22:48,734 INFO L350 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 154 treesize of output 138 [2023-02-16 03:22:48,745 INFO L350 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 138 treesize of output 114 [2023-02-16 03:22:51,229 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse43 (bvadd |c_ULTIMATE.start_main_#t~malloc18#1.offset| (_ bv4 32)))) (let ((.cse33 (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_#t~malloc18#1.base|)) (.cse179 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1237 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1238 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1237 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1238) (bvule .cse1237 .cse1238))))) (.cse180 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1234 (select |c_#length| v_arrayElimCell_74)) (.cse1233 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1233 .cse1234) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1236 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1235 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1235 .cse1234) (bvule .cse1235 .cse1236)))) (bvule .cse1233 .cse1236)))))))) (.cse181 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1231 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1232 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1231 .cse1232) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1232))))) (bvule .cse1231 (select |c_#length| v_arrayElimCell_74)))))) (.cse439 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1230 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1229 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1229) (bvule .cse1230 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1230 .cse1229))))) (.cse198 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1228 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1228 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1228 (select |c_#length| v_arrayElimCell_70)))))) (.cse359 (select |c_#length| |c_ULTIMATE.start_main_#t~malloc18#1.base|)) (.cse118 (select |c_#length| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse26 (= |c_ULTIMATE.start_main_~root~0#1.base| |c_ULTIMATE.start_main_#t~malloc18#1.base|))) (let ((.cse42 (not .cse26)) (.cse477 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1226 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1226) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1226) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1227 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1227 (select |c_#length| v_arrayElimCell_73)) (bvule .cse1227 .cse1226)))))))) (.cse474 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse1223 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse1223) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1224 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1224) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1224) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1225 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1225 .cse1223) (bvule .cse1225 .cse1224))))))))))) (.cse475 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1222 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1222) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1222) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1222))))) (.cse723 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1221 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1221) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1221))))) (.cse62 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1219 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1220 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1219 .cse118) (bvule .cse43 .cse1220) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1220) (bvule .cse1219 .cse1220))))) (.cse468 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1216 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1217 (select |c_#length| v_arrayElimCell_70)) (.cse1218 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1216 .cse118) (bvule .cse43 .cse1217) (bvule .cse1218 .cse1217) (bvule .cse1216 .cse1217) (bvule .cse1218 .cse118))))) (.cse430 (bvule .cse43 .cse118)) (.cse431 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1214 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1215 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1214 .cse118) (bvule .cse43 .cse1215) (bvule .cse1214 .cse1215))))) (.cse696 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse1213 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1210 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1212 (select |c_#length| v_arrayElimCell_70)) (.cse1211 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1210 .cse118) (bvule .cse1211 .cse1212) (bvule .cse1213 .cse1212) (bvule .cse1210 .cse1212) (bvule .cse1211 .cse118)))) (bvule .cse1213 .cse118))))) (.cse172 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1207 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1209 (select |c_#length| v_arrayElimCell_70)) (.cse1208 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1207 .cse118) (bvule .cse1208 .cse1209) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1209) (bvule .cse1207 .cse1209) (bvule .cse1208 .cse118))))) (.cse60 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1206 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1206 .cse118) (bvule .cse1206 (select |c_#length| v_arrayElimCell_70)))))) (.cse203 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse118))) (.cse166 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1205 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1204 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse1203 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1203 .cse1204) (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse1203 (select |c_#length| v_arrayElimCell_66)))))) (bvule .cse1205 .cse1204)))) (bvule .cse1205 .cse118))))) (.cse168 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1202 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1201 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1201)) (bvule .cse1202 .cse1201)))) (bvule .cse1202 .cse118))))) (.cse470 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1200 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1200 (select |c_#length| v_arrayElimCell_73)) (bvule .cse1200 (select |c_#length| v_arrayElimCell_70)))))) (.cse517 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1198 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1199 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1198 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1199) (bvule .cse1198 .cse1199))))) (.cse231 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1196 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1197 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1196 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1197) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1197) (bvule .cse1196 .cse1197))))) (.cse405 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse1193 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1193 .cse118) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1194 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1195 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1194 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1195) (bvule .cse1193 .cse1195) (bvule .cse1194 .cse1195)))))))) (.cse706 (forall ((v_arrayElimCell_71 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse359))) (.cse711 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1192 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1192 .cse359) (bvule .cse1192 (select |c_#length| v_arrayElimCell_70)))))) (.cse348 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) (select |c_#length| v_arrayElimCell_70)))) (.cse349 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1191 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1191) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1191))))) (.cse350 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1190 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1190) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1190) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1190))))) (.cse352 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1189 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1189) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1189))))) (.cse14 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1188 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1187 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1187 .cse118) (bvule .cse1187 .cse1188)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1188))))) (.cse6 (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1186 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1185 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1184 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1184 .cse118) (bvule .cse1184 .cse1185)))) (bvule .cse1186 .cse1185)))) (bvule .cse1186 .cse118))))) (.cse297 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1181 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1183 (select |c_#length| v_arrayElimCell_70)) (.cse1182 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1181 .cse118) (bvule .cse1182 .cse1183) (bvule .cse1181 .cse1183) (bvule .cse1182 .cse118))))) (.cse542 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1179 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1180 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1179 .cse1180) (bvule .cse1179 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1180))))) (.cse445 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1178 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1177 (select |c_#length| v_arrayElimCell_74)) (.cse1176 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1175 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1175) (bvule .cse1176 .cse1177) (bvule .cse1178 .cse1175) (bvule .cse1178 .cse1177) (bvule .cse1176 .cse1175))))) (.cse716 (and .cse439 .cse198)) (.cse518 (and .cse179 .cse180 .cse181)) (.cse435 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1174 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1173 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1173) (bvule .cse1174 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1173) (bvule .cse1174 .cse1173))))) (.cse224 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1171 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1170 (select |c_#length| v_arrayElimCell_74)) (.cse1169 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1172 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1169 .cse1170) (bvule .cse1171 .cse1172) (bvule .cse1171 .cse1170) (bvule .cse1169 .cse1172))))) (.cse16 (not .cse33)) (.cse106 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1167 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1168 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1167 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1168) (bvule .cse1167 .cse1168))))) (.cse48 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse1163 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1166 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1164 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1163 .cse1164) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1165 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1165 .cse1166) (bvule .cse1165 .cse1164))))))) (bvule .cse1163 .cse1166))))) (.cse232 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1161 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1162 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1161 .cse1162) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1162))))) (bvule .cse1161 (select |c_#length| v_arrayElimCell_73)))))))) (.cse53 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1157 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1160 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1158 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1157 .cse1158) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1159 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1159 .cse1160) (bvule .cse1159 .cse1158))))))) (bvule .cse1157 .cse1160)))))))) (let ((.cse433 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1155 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1156 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1155 (select |c_#length| v_arrayElimCell_73)) (bvule .cse43 .cse1156) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1156) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse1155 .cse1156))))) (.cse315 (and .cse106 .cse48 .cse232 .cse53)) (.cse434 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1153 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1154 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1153 (select |c_#length| v_arrayElimCell_73)) (bvule .cse43 .cse1154) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1154) (bvule .cse1153 .cse1154))))) (.cse471 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1151 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1152 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1151 (select |c_#length| v_arrayElimCell_73)) (bvule .cse43 .cse1152) (bvule .cse1151 .cse1152))))) (.cse319 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1150 (select |c_#length| v_arrayElimCell_70)) (.cse1149 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1149 .cse1150) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1150) (bvule .cse1149 (select |c_#length| v_arrayElimCell_73)))))) (.cse176 (or .cse224 .cse16)) (.cse714 (or .cse435 .cse33)) (.cse187 (or .cse198 .cse16)) (.cse447 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1148 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1147 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse1147) (bvule .cse1148 .cse1147)))) (bvule .cse1148 (select |c_#length| v_arrayElimCell_70)))))) (.cse437 (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1146 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1145 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1145 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1145 .cse1146)))) (bvule .cse43 .cse1146))))) (.cse717 (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1144 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1143 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1143) (bvule .cse1144 .cse1143) (bvule .cse1144 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1143)))) .cse16)) (.cse191 (or .cse518 .cse16)) (.cse192 (or .cse33 .cse179)) (.cse193 (or .cse179 .cse16)) (.cse438 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1140 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse1140) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1142 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1141 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1141 .cse1140) (bvule .cse1141 .cse1142)))) (bvule .cse43 .cse1142)))))))) (.cse718 (or .cse33 .cse716)) (.cse719 (or .cse439 .cse16)) (.cse720 (or .cse445 .cse16)) (.cse195 (or .cse542 .cse16)) (.cse721 (or .cse435 .cse16)) (.cse453 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1138 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1139 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1137 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1137 .cse1138) (bvule .cse1137 .cse1139)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1139)))) (bvule .cse43 .cse1138))))) (.cse436 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1133 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse1133) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1134 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1134 .cse1133) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1136 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1135 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1135 .cse1133) (bvule .cse1135 .cse1136)))) (bvule .cse43 .cse1136) (bvule .cse1134 .cse1136))))))))))) (.cse715 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1132 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1131 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1131) (bvule .cse1132 .cse1131) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1131))))) (bvule .cse1132 (select |c_#length| v_arrayElimCell_74)))))) (.cse444 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1129 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1130 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1128 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1127 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse1127) (bvule .cse1128 .cse1127) (bvule .cse1129 .cse1127)))) (bvule .cse1128 .cse1130)))) (bvule .cse1129 .cse1130))))) (.cse440 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1124 (select |c_#length| v_arrayElimCell_74)) (.cse1123 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1123 .cse1124) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1126 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1125 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1125 .cse1124) (bvule .cse1125 .cse1126)))) (bvule .cse43 .cse1126) (bvule .cse1123 .cse1126)))))))) (.cse442 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1120 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse1120) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1122 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1121 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1121 .cse1120) (bvule .cse1121 .cse1122)))) (bvule .cse43 .cse1122) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1122)))))))) (.cse194 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1119 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1118 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1118 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1118 .cse1119)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1119))))) (.cse441 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1117 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1116 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1116 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1116 .cse1117)))) (bvule .cse43 .cse1117) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1117))))) (.cse85 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1115 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1114 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1114) (bvule .cse1115 .cse1114) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1114))))) (bvule .cse1115 (select |c_#length| v_arrayElimCell_73))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (.cse40 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse1111 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1113 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1110 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1110) (bvule .cse1111 .cse1110) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1112 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1112 .cse1113) (bvule .cse1112 .cse1110))))))) (bvule .cse1111 .cse1113))))) (.cse555 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1106 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1109 (select |c_#length| v_arrayElimCell_70)) (.cse1108 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1107 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse1106 .cse1107) (bvule .cse1108 .cse1109) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse1106 .cse1109) (bvule .cse1108 .cse1107))))) (.cse307 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1104 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1105 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1104 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1105) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse1104 .cse1105))))) (.cse312 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1100 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1103 (select |c_#length| v_arrayElimCell_70)) (.cse1102 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1101 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse1100 .cse1101) (bvule .cse1102 .cse1103) (bvule .cse1100 .cse1103) (bvule .cse1102 .cse1101))))) (.cse317 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1098 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1099 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1098 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1099) (bvule .cse1098 .cse1099))))) (.cse469 (and .cse6 .cse297)) (.cse467 (and .cse106 .cse14)) (.cse143 (and .cse348 .cse349 .cse350 .cse352)) (.cse708 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1097 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1096 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1096 .cse359) (bvule .cse1096 .cse1097)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1097))))) (.cse707 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse359))) (.cse709 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1095 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1094 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1094) (bvule .cse1095 .cse359) (bvule .cse1095 .cse1094))))) (.cse710 (or .cse706 .cse711)) (.cse712 (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1093 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1092 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1091 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1091 .cse359) (bvule .cse1091 .cse1092)))) (bvule .cse1093 .cse1092)))) (bvule .cse1093 .cse359))))) (.cse298 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse359))) (.cse137 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1090 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1090 (select |c_#length| v_arrayElimCell_66)) (bvule .cse1090 .cse118))))) (.cse415 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1086 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1088 (select |c_#length| v_arrayElimCell_70)) (.cse1089 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse1087 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1086 .cse118) (bvule .cse1087 .cse1088) (bvule .cse1089 .cse1088) (bvule .cse1086 .cse1088) (bvule .cse1089 .cse118) (bvule .cse1087 .cse118))))) (.cse656 (and .cse231 .cse405)) (.cse110 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1085 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1084 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1083 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1083 .cse118) (bvule .cse1083 .cse1084)))) (bvule .cse1085 .cse1084) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1084)))) (bvule .cse1085 .cse118))))) (.cse113 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1082 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1081 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1081 .cse118) (bvule .cse1081 .cse1082)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1082) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1082))))) (.cse241 (and .cse470 .cse517)) (.cse423 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1078 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1080 (select |c_#length| v_arrayElimCell_70)) (.cse1079 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1078 .cse118) (bvule .cse1079 .cse1080) (bvule .cse1078 .cse1080) (bvule .cse1079 .cse118))))) (.cse648 (and .cse166 .cse168)) (.cse369 (or .cse60 .cse203)) (.cse174 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1077 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1075 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1075) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse1076 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1076 .cse1075) (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse1076 (select |c_#length| v_arrayElimCell_66)))))) (bvule .cse1077 .cse1075)))) (bvule .cse1077 .cse118))))) (.cse175 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1073 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1073 .cse118) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1074 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1074)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1074) (bvule .cse1073 .cse1074)))))))) (.cse225 (and .cse231 .cse405 .cse696 .cse172)) (.cse376 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1071 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1072 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1071 .cse118) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1072) (bvule .cse1071 .cse1072))))) (.cse368 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse1069 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1068 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1070 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1068 .cse118) (bvule .cse1069 .cse1070) (bvule .cse1068 .cse1070)))) (bvule .cse1069 .cse118))))) (.cse704 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1065 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse1066 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1067 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1065 (select |c_#length| v_arrayElimCell_66)) (bvule .cse1066 .cse118) (bvule .cse1065 .cse1067) (bvule .cse1066 .cse1067))))) (.cse420 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1062 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1063 (select |c_#length| v_arrayElimCell_70)) (.cse1064 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1062 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1063) (bvule .cse1064 .cse1063) (bvule .cse1062 .cse1063) (bvule .cse1064 .cse118))))) (.cse847 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1061 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1061) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse1061))))) (.cse846 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) (select |c_#length| v_arrayElimCell_70)))) (.cse105 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) (select |c_#length| v_arrayElimCell_66)))) (.cse36 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1058 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1060 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1057 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1057) (bvule .cse1058 .cse1057) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1059 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1059 .cse1060) (bvule .cse1059 .cse1057))))))) (bvule .cse1058 .cse1060)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (.cse459 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse1054 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse1054) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1055 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1055) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1055) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1056 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1056 .cse1054) (bvule .cse1056 .cse1055))))))))))) (.cse460 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1052 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1052) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1052) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1053 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1053 (select |c_#length| v_arrayElimCell_73)) (bvule .cse1053 .cse1052)))))))))) (.cse37 (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1050 (select |c_#length| v_arrayElimCell_70)) (.cse1051 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse43 .cse1050) (bvule .cse1051 .cse1050) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1050) (bvule .cse1051 (select |c_#length| v_arrayElimCell_73))))) .cse16)) (.cse46 (or .cse431 .cse16)) (.cse432 (or .cse430 .cse431)) (.cse1018 (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) (select |c_#length| v_arrayElimCell_66)))) (.cse713 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1049 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse1049) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1049))))) (.cse705 (forall ((v_arrayElimCell_70 (_ BitVec 32))) (bvule .cse43 (select |c_#length| v_arrayElimCell_70)))) (.cse1030 (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1048 (select |c_#length| v_arrayElimCell_66))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1048) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse1048))))) (.cse487 (or .cse430 .cse468)) (.cse59 (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse43 (select |c_#length| v_arrayElimCell_66)))) (.cse465 (or .cse430 .cse62)) (.cse30 (or .cse62 .cse16)) (.cse5 (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1047 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1046 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1046 .cse118) (bvule .cse1046 .cse1047)))) (bvule .cse43 .cse1047) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1047))))) (.cse13 (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1045 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1044 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1043 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1043 .cse118) (bvule .cse1043 .cse1044)))) (bvule .cse43 .cse1044) (bvule .cse1045 .cse1044)))) (bvule .cse1045 .cse118))))) (.cse724 (and .cse348 .cse475 .cse723 .cse352)) (.cse429 (and .cse477 .cse474)) (.cse473 (and .cse430 .cse42)) (.cse51 (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1042 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1041 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1041 .cse118) (bvule .cse1041 .cse1042)))) (bvule .cse43 .cse1042)))))) (let ((.cse204 (and .cse60 (or .cse60 .cse26))) (.cse69 (or .cse473 (and (or .cse431 .cse26) .cse51))) (.cse428 (or .cse429 .cse42)) (.cse25 (or .cse724 .cse16)) (.cse1 (or .cse473 (and .cse13 (or .cse468 .cse26)))) (.cse2 (or (and (or .cse62 .cse26) .cse5) .cse473)) (.cse63 (or (and .cse465 .cse30) .cse26)) (.cse64 (and .cse42 .cse59 .cse16)) (.cse413 (and .cse62 .cse487 .cse468 .cse465)) (.cse476 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvule .cse43 (select |c_#length| v_arrayElimCell_73)))) (.cse479 (or .cse705 .cse1030)) (.cse484 (or .cse1018 .cse713)) (.cse485 (or .cse705 .cse1018)) (.cse486 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (bvule .cse43 (select |c_#length| v_arrayElimCell_73)) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (.cse427 (or .cse430 .cse60)) (.cse513 (and .cse46 .cse432)) (.cse425 (and .cse36 (or (and .cse459 .cse460) .cse33) .cse37)) (.cse162 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1038 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1038 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1040 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1039 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1039 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1039 .cse1040)))) (bvule .cse1038 .cse1040)))))))) (.cse95 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1034 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1035 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse1034 .cse1035) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1037 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1036 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1036 .cse1035) (bvule .cse1036 .cse1037)))) (bvule .cse1034 .cse1037))))))) (bvule .cse1034 (select |c_#length| v_arrayElimCell_66)))))) (.cse279 (or .cse198 .cse105)) (.cse525 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1031 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1031 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1032 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1033 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse1032 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1031 .cse1033) (bvule .cse1032 .cse1033)))))))) (.cse514 (or .cse846 .cse1030)) (.cse478 (forall ((v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1028 (select |c_#length| v_arrayElimCell_66))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1028)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1029 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1029 (select |c_#length| v_arrayElimCell_70)) (bvule .cse1029 .cse1028)))))))) (.cse480 (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1026 (select |c_#length| v_arrayElimCell_70)) (.cse1027 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1026) (bvule .cse1027 .cse1026) (bvule .cse1027 (select |c_#length| v_arrayElimCell_66)))))) (.cse515 (or .cse1018 .cse846)) (.cse481 (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1025 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1024 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1024 .cse1025) (bvule .cse1024 (select |c_#length| v_arrayElimCell_66))))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1025))))) (.cse482 (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1023 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse1022 (select |c_#length| v_arrayElimCell_66))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1021 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1020 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1020 .cse1021) (bvule .cse1020 .cse1022)))) (bvule .cse1023 .cse1021)))) (bvule .cse1023 .cse1022))))) (.cse483 (forall ((v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1019 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1019 (select |c_#length| v_arrayElimCell_70)) (bvule .cse1019 (select |c_#length| v_arrayElimCell_66)))))) (.cse516 (or .cse1018 .cse847)) (.cse216 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1015 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1015 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1017 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1016 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1016 (select |c_#length| v_arrayElimCell_74)) (bvule .cse1016 .cse1017)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1017) (bvule .cse1015 .cse1017)))))))) (.cse163 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1010 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1010 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1011 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse1010 .cse1011) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse1012 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1012 .cse1011) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1014 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1013 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1013 .cse1011) (bvule .cse1013 .cse1014)))) (bvule .cse1012 .cse1014) (bvule .cse1010 .cse1014)))))))))))))) (.cse289 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1005 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1005 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1007 (select |c_#length| v_arrayElimCell_74)) (.cse1006 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse1006 .cse1007) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1009 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1008 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1008 .cse1007) (bvule .cse1008 .cse1009)))) (bvule .cse1006 .cse1009) (bvule .cse1005 .cse1009))))))))))) (.cse141 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse1001 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse1001 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse1003 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse1004 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1002 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse1002 .cse1003) (bvule .cse1002 .cse1004)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1004) (bvule .cse1001 .cse1004)))) (bvule .cse1001 .cse1003)))))))) (.cse259 (or .cse224 .cse105)) (.cse230 (or .cse179 .cse105)) (.cse524 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse998 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse999 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse1000 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse998 (select |c_#length| v_arrayElimCell_66)) (bvule .cse999 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse1000) (bvule .cse998 .cse1000) (bvule .cse999 .cse1000))))) (.cse328 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse996 (select |c_#length| v_arrayElimCell_74)) (.cse995 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse997 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse995 .cse996) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse997) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse996) (bvule .cse995 .cse997))))) (.cse324 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse992 (select |c_#length| v_arrayElimCell_74)) (.cse993 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse991 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse994 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse991 .cse992) (bvule .cse993 .cse992) (bvule .cse993 .cse994) (bvule .cse991 .cse994))))) (.cse330 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse989 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse988 (select |c_#length| v_arrayElimCell_74)) (.cse987 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse990 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse987 .cse988) (bvule .cse989 .cse990) (bvule .cse989 .cse988) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse988) (bvule .cse987 .cse990))))) (.cse184 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse986 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse985 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse985 (select |c_#length| v_arrayElimCell_74)) (bvule .cse985 .cse986)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse986) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse986))))) (.cse332 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse981 (select |c_#length| v_arrayElimCell_74)) (.cse980 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse980 .cse981) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse983 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse982 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse984 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse982 .cse981) (bvule .cse983 .cse984) (bvule .cse983 .cse981) (bvule .cse980 .cse984) (bvule .cse982 .cse984)))))))) (.cse218 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse978 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse979 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse978 .cse979) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse979)))) (bvule .cse978 (select |c_#length| v_arrayElimCell_70)))))) (.cse220 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse977 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse975 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse976 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse974 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse974 .cse975) (bvule .cse974 .cse976)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse976) (bvule .cse977 .cse976)))) (bvule .cse977 .cse975))))) (.cse338 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse972 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse971 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse973 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse971 .cse972) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse973) (bvule .cse971 .cse973)))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse972))))) (.cse188 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse970 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse969 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse969 (select |c_#length| v_arrayElimCell_74)) (bvule .cse969 .cse970)))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse970))))) (.cse217 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse967 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse968 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse967 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse968) (bvule .cse967 .cse968))))) (.cse221 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse963 (select |c_#length| v_arrayElimCell_74)) (.cse962 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse962 .cse963) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse964 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse964 .cse963) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse966 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse965 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse965 .cse963) (bvule .cse965 .cse966)))) (bvule .cse964 .cse966) (bvule .cse962 .cse966))))))))))) (.cse326 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse959 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse958 (select |c_#length| v_arrayElimCell_74)) (.cse961 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse957 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse960 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse957 .cse958) (bvule .cse959 .cse960) (bvule .cse959 .cse958) (bvule .cse961 .cse958) (bvule .cse961 .cse960) (bvule .cse957 .cse960))))) (.cse178 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse955 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse956 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse955 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse956) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse956) (bvule .cse955 .cse956))))) (.cse222 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse953 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse954 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse952 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse952 .cse953) (bvule .cse952 .cse954)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse954)))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse953))))) (.cse219 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse949 (select |c_#length| v_arrayElimCell_74)) (.cse948 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse948 .cse949) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse951 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse950 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse950 .cse949) (bvule .cse950 .cse951)))) (bvule .cse948 .cse951)))))))) (.cse223 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse946 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse947 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse944 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse945 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse944 .cse945) (bvule .cse946 .cse945) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse945)))) (bvule .cse944 .cse947)))) (bvule .cse946 .cse947))))) (.cse331 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse941 (select |c_#length| v_arrayElimCell_74)) (.cse943 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse940 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse942 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse940 .cse941) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse942) (bvule .cse943 .cse941) (bvule .cse943 .cse942) (bvule .cse940 .cse942))))) (.cse333 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse937 (select |c_#length| v_arrayElimCell_74)) (.cse936 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse936 .cse937) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse938 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse939 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse938 .cse937) (bvule .cse936 .cse939) (bvule .cse938 .cse939)))))))) (.cse323 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse934 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse933 (select |c_#length| v_arrayElimCell_74)) (.cse932 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse935 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse932 .cse933) (bvule .cse934 .cse935) (bvule .cse934 .cse933) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse935) (bvule .cse932 .cse935))))) (.cse336 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse931 (select |c_#length| v_arrayElimCell_74)) (.cse930 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse930 .cse931) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse931) (bvule .cse930 (select |c_#length| v_arrayElimCell_70)))))) (.cse177 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse927 (select |c_#length| v_arrayElimCell_74)) (.cse926 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse926 .cse927) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse929 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse928 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse928 .cse927) (bvule .cse928 .cse929)))) (bvule .cse926 .cse929) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse929)))))))) (.cse334 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse925 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse924 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse924 .cse925) (bvule .cse924 (select |c_#length| v_arrayElimCell_70))))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse925))))) (.cse322 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse923 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse921 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse920 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse922 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse920 .cse921) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse922) (bvule .cse923 .cse922) (bvule .cse920 .cse922)))) (bvule .cse923 .cse921))))) (.cse242 (or .cse420 .cse16)) (.cse96 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse917 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse917 .cse118) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse918 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse918) (bvule .cse917 .cse918) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse919 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse919 .cse918) (bvule .cse919 .cse118) (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse919 (select |c_#length| v_arrayElimCell_66))))))))))))) (.cse381 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse914 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse915 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse916 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse914 (select |c_#length| v_arrayElimCell_66)) (bvule .cse915 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse916) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse914 .cse916) (bvule .cse915 .cse916))))) (.cse276 (or .cse704 .cse16)) (.cse579 (and .cse376 .cse368)) (.cse580 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse910 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse910 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse911 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse910 .cse911) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse912 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse912) (bvule .cse910 .cse912) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse913 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse913 .cse911) (bvule .cse913 .cse912))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))))))) (.cse424 (or .cse225 .cse16)) (.cse581 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse908 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse909 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse908 (select |c_#length| v_arrayElimCell_66)) (bvule .cse908 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse909) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse908 .cse909) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse909))))) (.cse131 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse906 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse907 (select |c_#length| v_arrayElimCell_70)) (.cse905 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse905 (select |c_#length| v_arrayElimCell_66)) (bvule .cse906 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse907) (bvule .cse905 .cse907) (bvule .cse906 .cse907) (bvule .cse905 .cse118))))) (.cse320 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse903 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse903) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse903) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse904 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse904 (select |c_#length| v_arrayElimCell_73)) (bvule .cse904 .cse903))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (.cse321 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse899 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse900 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse899 .cse900) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse901 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse901) (bvule .cse899 .cse901) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse902 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse902 .cse900) (bvule .cse902 .cse901))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))) (.cse202 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse898 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse898 .cse118) (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse898 (select |c_#length| v_arrayElimCell_66))))))) (.cse347 (and .cse174 .cse175)) (.cse616 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse894 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse894 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse895 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse894 .cse895) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse896 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse896) (bvule .cse894 .cse896) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse897 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse897 .cse895) (bvule .cse897 .cse896)))))))))))))) (.cse392 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse891 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse892 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse893 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse891 (select |c_#length| v_arrayElimCell_66)) (bvule .cse892 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse893) (bvule .cse891 .cse893) (bvule .cse892 .cse893))))) (.cse355 (or (and .cse60 .cse369) .cse16)) (.cse318 (or .cse60 .cse105 .cse16)) (.cse153 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse888 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse889 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse890 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse888 (select |c_#length| v_arrayElimCell_66)) (bvule .cse889 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse890) (bvule .cse888 .cse890) (bvule .cse889 .cse890)))) .cse16)) (.cse354 (or .cse648 .cse16)) (.cse229 (or .cse423 .cse16)) (.cse207 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse885 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse885 .cse118) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse886 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse885 .cse886) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse887 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse887 .cse886) (bvule .cse887 .cse118) (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse887 (select |c_#length| v_arrayElimCell_66))))))))))))) (.cse414 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse882 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse884 (select |c_#length| v_arrayElimCell_70)) (.cse881 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse883 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse881 (select |c_#length| v_arrayElimCell_66)) (bvule .cse882 .cse118) (bvule .cse883 .cse884) (bvule .cse881 .cse884) (bvule .cse882 .cse884) (bvule .cse881 .cse118) (bvule .cse883 .cse118))))) (.cse287 (or .cse42 .cse241)) (.cse280 (or .cse470 .cse42 .cse105)) (.cse266 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse878 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse879 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse880 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse878 (select |c_#length| v_arrayElimCell_66)) (bvule .cse879 (select |c_#length| v_arrayElimCell_73)) (bvule .cse878 .cse880) (bvule .cse879 .cse880)))) .cse42)) (.cse170 (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse875 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse874 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse874 .cse118) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse876 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse875 .cse876) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse877 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse877 .cse876) (forall ((v_arrayElimCell_66 (_ BitVec 32))) (bvule .cse877 (select |c_#length| v_arrayElimCell_66)))))) (bvule .cse874 .cse876))))))) (bvule .cse875 .cse118))))) (.cse171 (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse872 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse873 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse871 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse871)) (bvule .cse872 .cse871) (bvule .cse873 .cse871)))) (bvule .cse873 .cse118)))) (bvule .cse872 .cse118))))) (.cse114 (or .cse42 .cse113)) (.cse126 (or .cse110 .cse42)) (.cse578 (or .cse656 .cse26)) (.cse157 (or .cse231 .cse16)) (.cse102 (or .cse420 .cse26)) (.cse238 (or .cse33 .cse231)) (.cse88 (or .cse415 .cse26)) (.cse236 (or .cse172 .cse16)) (.cse32 (and .cse42 .cse16)) (.cse591 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse868 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse868 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse869 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse870 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse869 .cse118) (bvule .cse868 .cse870) (bvule .cse869 .cse870)))) (bvule .cse868 .cse118))))) (.cse285 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse865 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse865 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse867 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse866 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse866 .cse118) (bvule .cse866 .cse867)))) (bvule .cse865 .cse867)))) (bvule .cse865 .cse118))))) (.cse655 (or .cse137 .cse60)) (.cse139 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse861 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse861 .cse359) (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse863 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse864 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse862 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse862 .cse863) (bvule .cse862 .cse864)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse864) (bvule .cse861 .cse864)))) (bvule .cse861 .cse863)))))))) (.cse372 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse858 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse858 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse860 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse859 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse859 (select |c_#length| v_arrayElimCell_74)) (bvule .cse859 .cse860)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse860) (bvule .cse858 .cse860)))))))) (.cse90 (or .cse224 .cse298)) (.cse340 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse853 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse853 .cse359) (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse854 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse853 .cse854) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse855 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse855 .cse854) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse857 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse856 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse856 .cse854) (bvule .cse856 .cse857)))) (bvule .cse855 .cse857) (bvule .cse853 .cse857)))))))))))))) (.cse303 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse848 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse848 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse850 (select |c_#length| v_arrayElimCell_74)) (.cse849 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse849 .cse850) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse852 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse851 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse851 .cse850) (bvule .cse851 .cse852)))) (bvule .cse849 .cse852) (bvule .cse848 .cse852))))))))))) (.cse165 (or .cse179 .cse298)) (.cse647 (or (and (or .cse706 .cse707 .cse846) (or .cse707 .cse847) .cse708 (or .cse707 .cse846) .cse709 .cse710 .cse711 .cse712) .cse16)) (.cse271 (or .cse143 .cse16)) (.cse671 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse843 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse844 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse845 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse843 .cse359) (bvule .cse844 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse845) (bvule .cse843 .cse845) (bvule .cse844 .cse845))))) (.cse293 (or .cse198 .cse298)) (.cse94 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse840 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse840 .cse359) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse842 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse841 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse841 (select |c_#length| v_arrayElimCell_74)) (bvule .cse841 .cse842)))) (bvule .cse840 .cse842)))))))) (.cse692 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse837 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse837 .cse359) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse838 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse839 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse838 (select |c_#length| v_arrayElimCell_74)) (bvule .cse837 .cse839) (bvule .cse838 .cse839)))))))) (.cse375 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse833 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse834 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse833 .cse834) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse836 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse835 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse835 .cse834) (bvule .cse835 .cse836)))) (bvule .cse833 .cse836))))))) (bvule .cse833 .cse359))))) (.cse594 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse829 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse829 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse830 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse832 (select |c_#length| v_arrayElimCell_70)) (.cse831 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse830 .cse118) (bvule .cse831 .cse832) (bvule .cse829 .cse832) (bvule .cse830 .cse832) (bvule .cse831 .cse118)))) (bvule .cse829 .cse118))))) (.cse125 (or .cse105 .cse297)) (.cse111 (or .cse137 .cse106)) (.cse416 (or .cse467 .cse203)) (.cse128 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse826 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse826 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse828 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse827 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse827 .cse118) (bvule .cse827 .cse828)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse828) (bvule .cse826 .cse828)))) (bvule .cse826 .cse118))))) (.cse417 (or .cse137 .cse467)) (.cse132 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse822 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse822 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse825 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse824 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse823 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse823 .cse118) (bvule .cse823 .cse824)))) (bvule .cse825 .cse824) (bvule .cse822 .cse824)))) (bvule .cse825 .cse118)))) (bvule .cse822 .cse118))))) (.cse418 (or .cse469 .cse203)) (.cse87 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse821 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse820 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse819 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse818 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse818 .cse118) (bvule .cse818 .cse819)))) (bvule .cse820 .cse819) (bvule .cse821 .cse819)))) (bvule .cse820 .cse118)))) (bvule .cse821 .cse118))))) (.cse419 (or .cse469 .cse137)) (.cse103 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse815 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse815 (select |c_#length| v_arrayElimCell_66)) (bvule .cse815 .cse118) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse816 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse817 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse816 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse817) (bvule .cse815 .cse817) (bvule .cse816 .cse817)))))))) (.cse112 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse814 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse813 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse812 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse812 .cse118) (bvule .cse812 .cse813)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse813) (bvule .cse814 .cse813)))) (bvule .cse814 .cse118))))) (.cse406 (or .cse106 .cse203)) (.cse108 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse808 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse808 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse811 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse810 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse809 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse809 .cse118) (bvule .cse809 .cse810)))) (bvule .cse811 .cse810) (bvule .cse808 .cse810)))) (bvule .cse811 .cse118)))))))) (.cse370 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse807 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse806 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse805 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse805 .cse118) (bvule .cse805 .cse806)))) (bvule .cse807 .cse806)))) (bvule .cse807 .cse118))))) (.cse654 (or (and (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse799 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse800 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse799 .cse800) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse801 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse801) (bvule .cse799 .cse801) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse802 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse802 .cse800) (bvule .cse802 .cse801)))))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse803 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse803) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse803) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse804 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse804 (select |c_#length| v_arrayElimCell_73)) (bvule .cse804 .cse803)))))))) .cse42)) (.cse592 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse796 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse796 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse797 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse798 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse797 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse798) (bvule .cse796 .cse798) (bvule .cse797 .cse798)))))))) (.cse421 (or .cse317 .cse105)) (.cse306 (or .cse312 .cse105)) (.cse234 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse795 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse794 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse794 .cse118) (bvule .cse794 .cse795)))) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse795))))) (.cse152 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse790 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse793 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse791 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse790 .cse791) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse791) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse792 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse792 .cse793) (bvule .cse792 .cse791))))))) (bvule .cse790 .cse793)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (.cse104 (or .cse106 .cse105)) (.cse593 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse787 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse787 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse788 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse789 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse788 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse789) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse787 .cse789) (bvule .cse788 .cse789)))))))) (.cse101 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse784 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse784 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse786 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse785 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse785 .cse118) (bvule .cse785 .cse786)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse786) (bvule .cse784 .cse786)))))))) (.cse115 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse781 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse779 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse783 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse780 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse779 .cse780) (bvule .cse781 .cse780) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse782 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse782 .cse783) (bvule .cse782 .cse780))))))) (bvule .cse779 .cse783)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))) (bvule .cse781 (select |c_#length| v_arrayElimCell_66)))))) (.cse422 (or .cse307 .cse105)) (.cse314 (or .cse555 .cse105)) (.cse155 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse775 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse778 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse776 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse775 .cse776) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse776) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse777 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse777 .cse778) (bvule .cse777 .cse776))))))) (bvule .cse775 .cse778))))) (.cse309 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse772 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse772 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse774 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse773 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse773 .cse118) (bvule .cse773 .cse774)))) (bvule .cse772 .cse774)))))))) (.cse120 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse767 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse767 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse768 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse771 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse769 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse768 .cse769) (bvule .cse767 .cse769) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse770 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse770 .cse771) (bvule .cse770 .cse769))))))) (bvule .cse768 .cse771)))))))) (.cse310 (or .cse60 .cse105)) (.cse391 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse765 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse766 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse765 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse766) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse766) (bvule .cse765 .cse766))))) (.cse385 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse763 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse764 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse763 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse764) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse764) (bvule .cse763 .cse764))))) (.cse136 (and (or .cse297 .cse26) .cse6)) (.cse464 (or .cse430 .cse106)) (.cse130 (and .cse14 (or .cse106 .cse26))) (.cse8 (and .cse36 .cse85 .cse106 .cse48 .cse62 .cse13 .cse5 .cse232 .cse6 .cse14 .cse53 .cse40)) (.cse189 (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) (select |c_#length| v_arrayElimCell_74))) .cse16)) (.cse458 (or .cse42 .cse724)) (.cse27 (and .cse176 .cse436 .cse437 .cse714 (or .cse33 (and .cse441 .cse442)) .cse440 .cse187 (or (and .cse447 .cse437 .cse438 .cse439 .cse198) .cse16) .cse180 .cse442 .cse717 .cse191 .cse192 .cse193 .cse438 .cse718 .cse719 .cse720 .cse194 .cse195 .cse198 .cse721 .cse441 (or (and .cse453 .cse435 .cse436 .cse715 .cse179 .cse444 .cse440 .cse180 .cse181 .cse442 .cse194 .cse224 .cse441) .cse16))) (.cse47 (or .cse319 .cse16)) (.cse472 (and .cse60 .cse431)) (.cse35 (and .cse470 .cse471)) (.cse31 (or .cse33 .cse62)) (.cse54 (or .cse33 .cse307)) (.cse56 (or .cse60 .cse16)) (.cse57 (or .cse434 .cse33)) (.cse49 (or .cse315 .cse16)) (.cse38 (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse759 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse761 (select |c_#length| v_arrayElimCell_70)) (.cse762 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse760 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse759 .cse760) (bvule .cse43 .cse761) (bvule .cse762 .cse761) (bvule .cse759 .cse761) (bvule .cse762 .cse760)))) .cse16)) (.cse72 (or .cse297 .cse16)) (.cse29 (or .cse468 .cse16)) (.cse50 (or .cse312 .cse16)) (.cse52 (or .cse33 .cse317)) (.cse239 (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) (select |c_#length| v_arrayElimCell_73)))) .cse16)) (.cse55 (or .cse106 .cse16)) (.cse73 (or .cse33 .cse106)) (.cse61 (or .cse33 .cse433)) (.cse325 (or .cse42 .cse224)) (.cse443 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse757 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse755 (select |c_#length| v_arrayElimCell_74)) (.cse756 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse758 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse755) (bvule .cse756 .cse755) (bvule .cse757 .cse758) (bvule .cse757 .cse755) (bvule .cse756 .cse758))))) (.cse450 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse752 (select |c_#length| v_arrayElimCell_74)) (.cse754 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse753 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse752) (bvule .cse43 .cse753) (bvule .cse754 .cse752) (bvule .cse754 .cse753))))) (.cse327 (or .cse42 .cse198)) (.cse457 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse750 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse750) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse751 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse751 .cse750) (bvule .cse751 (select |c_#length| v_arrayElimCell_70))))))))) (.cse329 (or .cse42 .cse179)) (.cse448 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse748 (select |c_#length| v_arrayElimCell_74)) (.cse749 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse43 .cse748) (bvule .cse749 .cse748) (bvule .cse749 (select |c_#length| v_arrayElimCell_70)))))) (.cse456 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse745 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse745) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse747 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse746 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse746) (bvule .cse747 .cse745) (bvule .cse747 .cse746)))))))) (.cse335 (or .cse42 .cse180)) (.cse449 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse743 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse742 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse744 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse742 .cse743) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse744) (bvule .cse742 .cse744)))) (bvule .cse43 .cse743))))) (.cse454 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse739 (select |c_#length| v_arrayElimCell_74)) (.cse740 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse741 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse739) (bvule .cse740 .cse739) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse741) (bvule .cse740 .cse741))))) (.cse451 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse735 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse735) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse738 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse737 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse736 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse736) (bvule .cse737 .cse735) (bvule .cse738 .cse736) (bvule .cse738 .cse735) (bvule .cse737 .cse736)))))))) (.cse452 (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse732 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse43 .cse732) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse734 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse733 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse733) (bvule .cse734 .cse732) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse733) (bvule .cse734 .cse733)))))))) (.cse455 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse731 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse728 (select |c_#length| v_arrayElimCell_74)) (.cse730 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse729 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse728) (bvule .cse43 .cse729) (bvule .cse730 .cse728) (bvule .cse731 .cse729) (bvule .cse731 .cse728) (bvule .cse730 .cse729))))) (.cse337 (or .cse42 .cse194)) (.cse446 (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse725 (select |c_#length| v_arrayElimCell_74)) (.cse727 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse726 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse725) (bvule .cse43 .cse726) (bvule .cse727 .cse725) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse726) (bvule .cse727 .cse726)))))) (let ((.cse21 (or (and .cse435 .cse437 (or (and .cse441 .cse452) .cse26) .cse325 .cse444 .cse445 (or (and .cse437 .cse439) .cse42) .cse442 .cse447 (or .cse443 .cse26) (or .cse450 .cse26) .cse327 .cse194 (or (and .cse456 .cse457 .cse437 .cse198) .cse26) (or (and .cse456 .cse457 .cse439 .cse198) .cse26) .cse198 .cse329 (or .cse42 .cse440) .cse441 (or .cse448 .cse26) .cse453 (or .cse42 .cse441) .cse436 (or .cse42 (and .cse435 .cse179 .cse194 .cse224 .cse440 .cse445 .cse180 .cse441)) (or .cse26 (and .cse456 .cse439)) (or .cse26 (and .cse435 .cse452)) .cse335 (or (and .cse435 .cse440) .cse42) (or .cse26 (and .cse194 .cse449)) (or .cse437 .cse42) .cse440 .cse180 (or .cse42 .cse716) (or .cse454 .cse26) (or .cse42 (and .cse437 .cse439 .cse198)) (or .cse42 (and .cse435 .cse440 .cse445 .cse441)) (or (and .cse435 .cse437 .cse179 .cse194 .cse439 .cse224 .cse440 .cse445 .cse198 .cse180 .cse441) .cse42) .cse438 (or (and .cse455 .cse435 .cse445 .cse446 .cse451 .cse452) .cse26) .cse439 (or .cse455 .cse26) .cse337 (or .cse446 .cse26)) .cse16)) (.cse17 (or (and .cse47 (or .cse472 .cse16) .cse48 (or .cse33 .cse35) .cse6 .cse30 .cse53 .cse31 .cse54 .cse56 .cse57 .cse60 .cse46 .cse49 .cse5 .cse38 .cse72 .cse29 .cse50 .cse51 .cse52 .cse40 .cse239 .cse55 .cse73 .cse36 .cse37 .cse61 .cse13 (or (and .cse36 .cse85 .cse106 .cse48 .cse62 .cse232 .cse53 .cse40) .cse16) .cse14) .cse42)) (.cse18 (or .cse33 .cse42 .cse724)) (.cse20 (or .cse27 .cse42)) (.cse22 (or (let ((.cse722 (and .cse348 .cse723))) (and .cse348 .cse475 (or .cse42 .cse722) (or .cse475 .cse26) .cse723 (or .cse723 .cse26) (or (and .cse475 .cse352) .cse42) .cse352 .cse458 (or .cse722 .cse26))) .cse16)) (.cse23 (or .cse42 (and .cse176 .cse437 .cse714 (or (and .cse435 .cse715 .cse179 .cse440 .cse180 .cse181) .cse16) .cse440 .cse187 (or .cse16 .cse716) .cse180 .cse189 .cse717 .cse191 .cse192 .cse193 .cse718 .cse719 .cse720 .cse194 .cse195 .cse198 .cse721 .cse441))) (.cse41 (and .cse36 .cse37 .cse38 .cse5 .cse30 .cse40)) (.cse39 (or (and .cse62 .cse13 .cse5 .cse468) .cse16)) (.cse4 (or .cse42 .cse8)) (.cse0 (or .cse130 .cse473)) (.cse3 (or (and .cse464 .cse14) .cse26)) (.cse10 (or (and .cse62 .cse13) .cse42)) (.cse12 (or (and .cse5 .cse465) .cse26)) (.cse15 (or .cse136 .cse473)) (.cse24 (or (and (or .cse705 .cse706 .cse707) .cse708 .cse709 .cse710 (or .cse705 .cse707) .cse711 .cse712 (or .cse713 .cse707)) .cse16)) (.cse28 (or (and .cse62 .cse465) .cse26)) (.cse86 (and .cse48 .cse232 .cse53)) (.cse9 (or .cse42 .cse106)) (.cse11 (or .cse42 .cse6)) (.cse247 (or (and .cse592 .cse421 .cse48 .cse306 .cse234 .cse152 .cse104 .cse317 .cse593 .cse53 .cse101 .cse115 .cse422 .cse314 .cse155 .cse309 .cse120 .cse310 .cse60 .cse391 .cse307 .cse385 .cse14 .cse113) .cse42)) (.cse252 (or .cse42 .cse704)) (.cse253 (or (and .cse309 .cse310) .cse42)) (.cse100 (or (and (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse697 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse698 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse697 .cse698) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse699 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse699) (bvule .cse697 .cse699) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse700 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse700 .cse698) (bvule .cse700 .cse699)))))))))) (bvule .cse697 .cse359)))) .cse654 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse702 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse701 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse701) (bvule .cse702 .cse701) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse703 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse703 (select |c_#length| v_arrayElimCell_73)) (bvule .cse703 .cse701))))))) (bvule .cse702 .cse359))))) .cse33)) (.cse256 (or .cse42 (and .cse370 .cse376 .cse234 .cse60))) (.cse258 (or (and .cse594 .cse125 .cse111 .cse416 .cse128 .cse405 .cse104 .cse417 .cse6 .cse132 .cse696 .cse101 .cse110 .cse418 .cse87 .cse419 .cse103 .cse112 .cse406 .cse14 .cse113 .cse108) .cse16)) (.cse160 (or .cse224 .cse16 .cse298)) (.cse89 (or (and .cse293 .cse94 .cse692 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse693 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse693 .cse359) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse694 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse695 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse694 .cse695) (bvule .cse693 .cse695)))) (bvule .cse694 (select |c_#length| v_arrayElimCell_70)))))))) .cse375) .cse16)) (.cse92 (or .cse671 .cse16)) (.cse164 (or .cse518 .cse16 .cse298)) (.cse98 (or .cse33 (and .cse293 .cse692))) (.cse304 (or .cse179 .cse16 .cse298)) (.cse305 (or .cse542 .cse16 .cse298)) (.cse169 (or .cse33 .cse179 .cse298)) (.cse363 (or .cse26 (and .cse647 .cse271))) (.cse364 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse690 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse689 (select |c_#length| v_arrayElimCell_74)) (.cse687 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse688 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse691 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse687 .cse359) (bvule .cse688 .cse689) (bvule .cse690 .cse691) (bvule .cse690 .cse689) (bvule .cse687 .cse691) (bvule .cse688 .cse691)))) .cse16)) (.cse173 (or .cse198 .cse16 .cse298)) (.cse339 (or (and (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse672 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse672 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse675 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse676 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse673 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse674 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse673 .cse674) (bvule .cse675 .cse674) (bvule .cse672 .cse674)))) (bvule .cse673 .cse676)))) (bvule .cse675 .cse676))))))) .cse139 .cse372 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse677 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse677 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse678 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse679 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse678 .cse679) (bvule .cse677 .cse679) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse679))))) (bvule .cse678 (select |c_#length| v_arrayElimCell_74)))))))) .cse90 .cse340 .cse303 .cse165 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse680 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse680 .cse359) (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse682 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse683 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse681 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse681 .cse682) (bvule .cse681 .cse683)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse683)))) (bvule .cse680 .cse682))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse686 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse684 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse685 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse684 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse685) (bvule .cse686 .cse685) (bvule .cse684 .cse685)))) (bvule .cse686 .cse359)))) (or .cse542 .cse298)) .cse16)) (.cse200 (or .cse33 .cse671)) (.cse374 (or .cse16 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse669 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse668 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse670 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse668 .cse359) (bvule .cse669 .cse670) (bvule .cse669 (select |c_#length| v_arrayElimCell_74)) (bvule .cse668 .cse670) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse670)))))) (.cse227 (or .cse33 (and .cse139 .cse372))) (.cse150 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse665 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse666 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse667 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse665 .cse359) (bvule .cse666 (select |c_#length| v_arrayElimCell_74)) (bvule .cse665 .cse667) (bvule .cse666 .cse667)))) .cse16)) (.cse261 (or (and .cse309 .cse310 .cse591 .cse285 .cse655) .cse16)) (.cse357 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse664 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse663 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse662 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse662 .cse118) (bvule .cse662 .cse663)))) (bvule .cse664 .cse663)))) (bvule .cse664 .cse359))))) (.cse362 (or .cse60 .cse298)) (.cse144 (or (and .cse114 .cse126 .cse87 .cse578 .cse157 .cse102 .cse112 .cse238 .cse88 .cse236) .cse32)) (.cse262 (or (and .cse370 .cse376 .cse234 .cse60 .cse368 .cse423 .cse369) .cse16)) (.cse146 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse659 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse661 (select |c_#length| v_arrayElimCell_70)) (.cse660 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse659 .cse359) (bvule .cse660 .cse661) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse659 .cse661) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse661) (bvule .cse660 (select |c_#length| v_arrayElimCell_73))))) .cse16)) (.cse44 (= |c_ULTIMATE.start_main_~root~0#1.offset| |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse91 (or (and (or .cse33 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse657 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse657 (select |c_#length| v_arrayElimCell_66)) (bvule .cse657 (select |c_#length| v_arrayElimCell_73)))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse658 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse658 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (bvule .cse658 (select |c_#length| v_arrayElimCell_73)) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))))) .cse26)) (.cse248 (or (and .cse170 .cse171) .cse16)) (.cse93 (or .cse33 (and .cse287 .cse280 .cse266))) (.cse109 (or .cse414 .cse26)) (.cse294 (or (and .cse229 .cse207) .cse26)) (.cse208 (or .cse42 (and .cse60 .cse166 .cse168))) (.cse250 (or (and .cse110 .cse108) .cse42)) (.cse97 (or (and .cse354 .cse229 .cse207) .cse26)) (.cse251 (or (and .cse103 (or .cse656 .cse16) .cse153) .cse26)) (.cse140 (or .cse42 .cse423)) (.cse260 (or .cse26 (and .cse355 .cse354 .cse229 .cse207 .cse318 .cse655))) (.cse145 (or .cse33 (and (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse652 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse653 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse652 (select |c_#length| v_arrayElimCell_66)) (bvule .cse652 (select |c_#length| v_arrayElimCell_73)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse653) (bvule .cse652 .cse653) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse653)))) .cse26) .cse616 .cse654 (or .cse392 .cse42)))) (.cse263 (or .cse347 .cse16)) (.cse205 (or .cse60 (and .cse202 .cse203))) (.cse206 (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse649 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse649 .cse118) (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse651 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse650 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse650 .cse651) (bvule .cse650 .cse118)))) (bvule .cse649 .cse651)))))))) (.cse209 (or .cse648 .cse42)) (.cse147 (or .cse26 (and .cse647 .cse271 .cse298))) (.cse264 (or .cse42 (and .cse101 .cse115 .cse155 .cse120 .cse152 .cse113))) (.cse265 (or (and .cse415 .cse87) .cse16)) (.cse353 (or .cse33 (and (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse640 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse640 .cse359) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse641 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse640 .cse641) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse642 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse642) (bvule .cse640 .cse642) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse643 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse643 .cse641) (bvule .cse643 .cse642))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse644 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse644 .cse359) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse645 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse645) (bvule .cse644 .cse645) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse646 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse646 (select |c_#length| v_arrayElimCell_73)) (bvule .cse646 .cse645))))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))))))) (.cse268 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse635 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse636 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse639 (select |c_#length| v_arrayElimCell_70)) (.cse638 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse637 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse635 (select |c_#length| v_arrayElimCell_66)) (bvule .cse636 .cse637) (bvule .cse638 .cse639) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse635 .cse639) (bvule .cse636 .cse639) (bvule .cse638 .cse637)))) .cse42)) (.cse270 (or .cse42 (and .cse152 .cse320 .cse321))) (.cse272 (or (and .cse594 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse595 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse596 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse599 (select |c_#length| v_arrayElimCell_70)) (.cse598 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse597 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse595 (select |c_#length| v_arrayElimCell_66)) (bvule .cse596 .cse597) (bvule .cse595 .cse597) (bvule .cse598 .cse599) (bvule .cse595 .cse599) (bvule .cse596 .cse599) (bvule .cse598 .cse597)))) .cse16) .cse580 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse600 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse600 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (bvule .cse600 (select |c_#length| v_arrayElimCell_73)) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse601 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse601) (bvule .cse600 .cse601) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse601))))))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse602 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse603 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse605 (select |c_#length| v_arrayElimCell_70)) (.cse604 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse602 (select |c_#length| v_arrayElimCell_66)) (bvule .cse603 .cse118) (bvule .cse604 .cse605) (bvule .cse602 .cse605) (bvule .cse603 .cse605) (bvule .cse604 .cse118)))) .cse16) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse606 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse606 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse607 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse606 .cse607) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse608 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse609 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse608 .cse607) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse609) (bvule .cse606 .cse609) (bvule .cse608 .cse609)))))))))) .cse153 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse610 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse613 (select |c_#length| v_arrayElimCell_70)) (.cse612 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse611 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse610 (select |c_#length| v_arrayElimCell_66)) (bvule .cse610 .cse611) (bvule .cse612 .cse613) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse610 .cse613) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse613) (bvule .cse612 .cse611)))) .cse16) (or .cse33 (and (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse614 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse614 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (bvule .cse614 (select |c_#length| v_arrayElimCell_73))) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse615 (select |c_#length| v_arrayElimCell_70))) (or (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse615) (bvule .cse614 .cse615) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse615))))))) .cse616)) .cse424 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse619 (select |c_#length| v_arrayElimCell_73)) (.cse617 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse618 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse620 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse617 (select |c_#length| v_arrayElimCell_66)) (bvule .cse618 .cse619) (bvule .cse617 .cse619) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse620) (bvule .cse617 .cse620) (bvule .cse618 .cse620)))) .cse16) .cse103 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse621 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse621 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse622 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse621 .cse622) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse623 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse624 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse623 .cse624) (bvule .cse621 .cse624) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse625 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse625 .cse622) (bvule .cse625 .cse624))))))) (bvule .cse623 .cse622)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))))) (or .cse581 .cse16) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse626 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse626 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse627 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse626 .cse627) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse628 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse630 (select |c_#length| v_arrayElimCell_70)) (.cse629 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse628 .cse627) (bvule .cse629 .cse630) (bvule .cse626 .cse630) (bvule .cse628 .cse630) (bvule .cse629 .cse627)))))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse631 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse631 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse632 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse631 .cse632) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse633 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse634 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse633 .cse634) (bvule .cse631 .cse634) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse634))))) (bvule .cse633 .cse632)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))))) (or .cse131 .cse16)) .cse26)) (.cse273 (or .cse42 (and .cse592 .cse125 .cse106 .cse152 .cse104 .cse6 .cse593 .cse101 .cse115 .cse155 .cse120 .cse391 .cse385 .cse14 .cse113))) (.cse356 (or .cse579 .cse16)) (.cse274 (or (and .cse591 .cse276) .cse26)) (.cse401 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse589 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse588 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse590 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse588 (select |c_#length| v_arrayElimCell_73)) (bvule .cse589 .cse359) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse590) (bvule .cse589 .cse590) (bvule .cse588 .cse590))))) (.cse400 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse586 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse585 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse587 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse585 (select |c_#length| v_arrayElimCell_73)) (bvule .cse586 .cse359) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse587) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse586 .cse587) (bvule .cse585 .cse587))))) (.cse282 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse583 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse584 (select |c_#length| v_arrayElimCell_70)) (.cse582 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse582 (select |c_#length| v_arrayElimCell_66)) (bvule .cse583 .cse118) (bvule .cse582 .cse584) (bvule .cse583 .cse584) (bvule .cse582 .cse118)))) .cse26)) (.cse283 (or .cse33 (and .cse580 (or .cse581 .cse26) (or .cse381 .cse42)))) (.cse365 (or .cse423 .cse26)) (.cse366 (or .cse579 .cse26)) (.cse371 (or .cse42 .cse234)) (.cse167 (or .cse376 .cse16)) (.cse284 (or (and .cse242 .cse96) .cse26)) (.cse373 (or (and .cse114 .cse126 .cse87 .cse578 .cse157 .cse102 .cse112 .cse88 .cse236) .cse32)) (.cse210 (or .cse87 .cse42)) (.cse286 (or .cse309 .cse42)) (.cse288 (or .cse42 .cse420)) (.cse226 (or .cse33 (and .cse287 (or .cse470 .cse298) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse575 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse575 .cse359) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse576 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse577 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse576 (select |c_#length| v_arrayElimCell_73)) (bvule .cse575 .cse577) (bvule .cse576 .cse577)))))))))) (.cse211 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse572 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse570 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse574 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse571 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse570 .cse571) (bvule .cse572 .cse571) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse573 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse573 .cse574) (bvule .cse573 .cse571))))))) (bvule .cse570 .cse574)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))) (bvule .cse572 .cse359))))) (.cse212 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse567 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse567 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse569 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse568 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse568 .cse118) (bvule .cse568 .cse569)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse569) (bvule .cse567 .cse569)))))))) (.cse299 (or .cse297 .cse298)) (.cse344 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse564 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse564 .cse359) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse565 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse566 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse565 .cse566) (bvule .cse564 .cse566) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse566))))) (bvule .cse565 (select |c_#length| v_arrayElimCell_73))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73))))))) (.cse343 (or .cse319 .cse298)) (.cse213 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse559 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse559 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse560 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse563 (select |c_#length| v_arrayElimCell_73))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse561 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse560 .cse561) (bvule .cse559 .cse561) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse562 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse562 .cse563) (bvule .cse562 .cse561))))))) (bvule .cse560 .cse563)))))))) (.cse345 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse556 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse556 .cse359) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse557 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse558 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse557 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse558) (bvule .cse556 .cse558) (bvule .cse557 .cse558)))))))) (.cse346 (or .cse312 .cse298)) (.cse295 (or .cse106 .cse298)) (.cse341 (or .cse555 .cse298)) (.cse342 (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse551 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse551 .cse359) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse554 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse553 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse552 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse552 .cse118) (bvule .cse552 .cse553)))) (bvule .cse554 .cse553) (bvule .cse551 .cse553)))) (bvule .cse554 .cse118)))))))) (.cse267 (or (and .cse328 .cse324 .cse330 .cse184 .cse332 .cse218 .cse220 .cse338 .cse188 .cse217 .cse221 .cse326 .cse194 .cse198 .cse178 .cse222 .cse180 .cse219 .cse223 .cse331 .cse333 .cse323 .cse336 .cse177 .cse334 .cse322) .cse16)) (.cse243 (or .cse542 .cse105 .cse16)) (.cse269 (or .cse42 (and .cse177 .cse217 .cse221 .cse178 .cse179 .cse184 .cse194 .cse198 .cse180 .cse220 .cse188 .cse219))) (.cse161 (or .cse33 .cse524)) (.cse244 (or .cse198 .cse105 .cse16)) (.cse245 (or .cse179 .cse105 .cse16)) (.cse275 (or (and .cse216 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse535 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse535 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse537 (select |c_#length| v_arrayElimCell_74))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse538 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse536 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse536 .cse537) (bvule .cse536 .cse538)))) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse538)))) (bvule .cse535 .cse537))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse539 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse539 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse540 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse541 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse540 .cse541) (bvule .cse539 .cse541) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse541))))) (bvule .cse540 (select |c_#length| v_arrayElimCell_74)))))))) .cse163 (or .cse542 .cse105) .cse289 .cse141 .cse259 .cse230 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse543 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse543 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse544 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse545 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse544 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse545) (bvule .cse543 .cse545) (bvule .cse544 .cse545))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse546 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse546 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse549 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse550 (select |c_#length| v_arrayElimCell_70))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse547 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse548 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse547 .cse548) (bvule .cse549 .cse548) (bvule .cse546 .cse548)))) (bvule .cse547 .cse550)))) (bvule .cse549 .cse550)))))))) .cse16)) (.cse249 (or (and .cse514 .cse478 .cse480 .cse515 .cse481 .cse482 .cse483 .cse516) .cse16)) (.cse277 (or .cse16 (and .cse162 .cse95 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse532 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse532 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse533 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse534 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse533 .cse534) (bvule .cse532 .cse534)))) (bvule .cse533 (select |c_#length| v_arrayElimCell_70)))))))) .cse279 .cse525))) (.cse278 (or (and .cse216 .cse141) .cse33)) (.cse254 (or .cse42 .cse143)) (.cse99 (or .cse224 .cse105 .cse16)) (.cse255 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse529 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse530 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse531 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse529 (select |c_#length| v_arrayElimCell_66)) (bvule .cse530 (select |c_#length| v_arrayElimCell_74)) (bvule .cse529 .cse531) (bvule .cse530 .cse531)))) .cse16)) (.cse257 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse527 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse526 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse528 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse526 (select |c_#length| v_arrayElimCell_66)) (bvule .cse527 .cse528) (bvule .cse527 (select |c_#length| v_arrayElimCell_74)) (bvule .cse526 .cse528) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse528)))) .cse16)) (.cse281 (or .cse42 (and .cse177 .cse217 .cse178 .cse179 .cse184 .cse194 .cse198 .cse180 .cse188))) (.cse138 (or .cse33 (and .cse279 .cse525))) (.cse142 (or .cse33 .cse179 .cse105)) (.cse228 (or .cse524 .cse16)) (.cse148 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse522 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse521 (select |c_#length| v_arrayElimCell_74)) (.cse519 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse520 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse523 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse519 (select |c_#length| v_arrayElimCell_66)) (bvule .cse520 .cse521) (bvule .cse522 .cse523) (bvule .cse522 .cse521) (bvule .cse519 .cse523) (bvule .cse520 .cse523)))) .cse16)) (.cse149 (or .cse518 .cse105 .cse16)) (.cse290 (or .cse42 (and .cse48 .cse106 .cse234 .cse152 .cse6 .cse317 .cse53 .cse110 .cse155 .cse470 .cse60 .cse391 .cse231 .cse307 .cse385 .cse14 .cse517 .cse113))) (.cse291 (or .cse42 .cse347)) (.cse292 (or (and (or (and .cse514 .cse478 .cse480 .cse515 .cse481 .cse105 .cse482 .cse483 .cse516) .cse16) .cse271 .cse105) .cse26)) (.cse75 (or (and .cse106 .cse62 .cse13 .cse5 .cse468 .cse6 .cse14 .cse297) .cse16)) (.cse74 (and .cse38 .cse72 .cse5 .cse6 .cse30 .cse40 .cse55 .cse36 .cse73 .cse57 .cse37 .cse61 .cse14)) (.cse76 (or .cse42 .cse425)) (.cse246 (= |c_ULTIMATE.start_main_~root~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse70 (or .cse513 .cse26)) (.cse65 (or (let ((.cse512 (and .cse59 .cse16))) (and (or .cse512 .cse513) (or .cse512 (and .cse427 .cse56)))) .cse26)) (.cse66 (or .cse33 (and (or .cse486 .cse475 .cse26) (or .cse42 .cse460) .cse459))) (.cse81 (or .cse27 .cse59)) (.cse79 (or (and .cse478 .cse479 .cse480 .cse481 .cse482 .cse483 .cse484 .cse485) .cse16)) (.cse19 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse34 (or .cse42 .cse35)) (.cse77 (or (and (or .cse413 .cse16) (or (and .cse487 (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse489 (select |c_#length| v_arrayElimCell_73)) (.cse488 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse490 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse488 .cse489) (bvule .cse43 .cse489) (bvule .cse43 .cse490) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse490) (bvule .cse488 .cse490)))) .cse16) .cse29 .cse465 (or .cse430 (and .cse62 .cse30)) .cse30 (or .cse486 .cse475 .cse16) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse491 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse491) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse492 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse493 (select |c_#length| v_arrayElimCell_70)) (.cse494 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse492 .cse491) (bvule .cse43 .cse493) (bvule .cse494 .cse493) (bvule .cse492 .cse493) (bvule .cse494 .cse491))))))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse496 (select |c_#length| v_arrayElimCell_70)) (.cse497 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse495 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse495) (bvule .cse43 .cse496) (bvule .cse497 .cse496) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse496) (bvule .cse497 .cse495)))) .cse16) (or (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse498 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse500 (select |c_#length| v_arrayElimCell_70)) (.cse501 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse499 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse498 .cse499) (bvule .cse43 .cse499) (bvule .cse43 .cse500) (bvule .cse501 .cse500) (bvule .cse498 .cse500) (bvule .cse501 .cse499)))) .cse16) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse502 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse502) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse504 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse503 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse503) (bvule .cse504 .cse503) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse505 (bvadd v_arrayElimCell_72 (_ bv4 32)))) (or (bvule .cse505 .cse502) (bvule .cse505 .cse503))))))) (bvule .cse504 .cse502)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse506 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse506) (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse508 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse507 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse43 .cse507) (bvule .cse508 .cse507) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse507))))) (bvule .cse508 .cse506)))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) .cse459 (forall ((v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse509 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse43 .cse509) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse510 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse511 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse510 .cse509) (bvule .cse43 .cse511) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse511) (bvule .cse510 .cse511))))))) (or .cse486 .cse475)) .cse59) (or .cse33 (and .cse474 (or .cse475 .cse476)) .cse59)) .cse26)) (.cse78 (or (and .cse1 .cse2 .cse63 .cse29 .cse30) .cse64)) (.cse82 (or (and .cse486 (or .cse33 .cse476)) .cse59 .cse26)) (.cse83 (or (and (or (and .cse478 .cse479 .cse480 .cse481 .cse59 .cse482 .cse483 .cse484 .cse485) .cse16) .cse59 .cse25) .cse26)) (.cse84 (or .cse33 (and (or (and .cse474 (or .cse475 .cse26 .cse476) (or .cse477 .cse42)) .cse59) .cse428))) (.cse80 (or .cse59 (and (or .cse42 .cse471) (or .cse470 .cse42)))) (.cse45 (or (and .cse106 .cse62 .cse60 .cse13 .cse5 .cse468 .cse431 .cse51 .cse6 .cse14 .cse297) .cse16)) (.cse7 (bvule .cse43 .cse359)) (.cse58 (and .cse46 .cse47 .cse48 .cse49 .cse38 .cse5 .cse50 .cse51 .cse52 .cse30 .cse53 .cse40 .cse54 .cse55 .cse36 .cse56 .cse57 .cse60 .cse37 .cse61 .cse14)) (.cse67 (or .cse42 (and .cse46 .cse51))) (.cse68 (or (and (or .cse42 .cse472) (or (and .cse427 .cse60 .cse51 .cse432) .cse26) (or .cse473 .cse204) .cse60 .cse69 .cse51) .cse16)) (.cse71 (or .cse42 (and .cse46 .cse56 .cse60 .cse51))) (.cse426 (and .cse431 .cse432))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) .cse17 .cse18 (or .cse19 (and .cse20 .cse21 .cse22 .cse18 .cse23 (or (and .cse24 .cse25) .cse26) (or .cse7 .cse27))) (or (and .cse1 .cse2 .cse28 .cse29 .cse30 .cse31) .cse32) (or .cse33 (and .cse34 (or .cse7 .cse35))) (or (and .cse36 .cse37 .cse38 .cse5 .cse30 .cse39 .cse40 (or .cse7 .cse41)) .cse42) .cse22 (bvule |c_ULTIMATE.start_main_#t~malloc18#1.offset| .cse43) (or .cse44 (and (or .cse42 (and .cse45 .cse46 .cse47 .cse48 .cse49 .cse38 .cse5 .cse50 .cse51 .cse52 .cse30 .cse53 .cse40 .cse54 .cse55 .cse36 .cse56 .cse57 (or .cse58 .cse59) .cse60 .cse37 .cse61 .cse14)) .cse21 .cse17 (or (and .cse1 (or .cse33 .cse42 .cse62) .cse2 .cse63 .cse29 .cse30) .cse64) .cse18 .cse65 (or (and .cse66 (or (and .cse36 .cse37) .cse42)) .cse59) (or (and .cse46 .cse67 .cse68 .cse69 .cse70 .cse71) .cse64) (or .cse42 (and .cse38 .cse72 .cse5 .cse6 .cse30 .cse40 .cse55 .cse36 .cse73 (or .cse74 .cse59) .cse57 .cse75 .cse37 .cse61 .cse14)) .cse76 .cse20 .cse77 .cse78 .cse22 (or (and .cse79 .cse25) .cse26) (or .cse33 (and .cse34 .cse80)) .cse81 .cse23 .cse82 .cse83 .cse84 (or .cse42 (and .cse36 (or .cse41 .cse59) .cse37 .cse38 .cse5 .cse30 .cse39 .cse40)) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse12 .cse13 .cse14 .cse15 (or .cse42 (and .cse36 .cse85 .cse62 .cse40)) (or .cse86 .cse42)) .cse59) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16))) (or (and .cse7 .cse24 .cse25) .cse26) (or (and .cse1 .cse2 .cse28 .cse29 .cse30) .cse32) (or .cse44 (let ((.cse233 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse411 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse412 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse411 .cse412) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse412) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse412))))) (bvule .cse411 (select |c_#length| v_arrayElimCell_73))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))) (.cse367 (and .cse42 .cse203)) (.cse185 (and .cse217 .cse198))) (let ((.cse158 (or (and .cse110 .cse231 .cse113 .cse172) .cse16)) (.cse183 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse409 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse410 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse409 .cse410) (bvule .cse409 (select |c_#length| v_arrayElimCell_74)) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse410) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse410)))) .cse16)) (.cse186 (or .cse33 .cse185)) (.cse190 (or .cse217 .cse16)) (.cse196 (or .cse33 .cse178)) (.cse182 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse407 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse408 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse407 .cse408) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse408) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse408))))) (bvule .cse407 (select |c_#length| v_arrayElimCell_74)))))) (.cse197 (or .cse178 .cse16)) (.cse199 (or .cse323 .cse16)) (.cse107 (or (and .cse406 .cse14) .cse26)) (.cse124 (or .cse367 .cse130)) (.cse127 (or .cse42 (and .cse110 .cse231))) (.cse133 (or .cse42 (and .cse110 .cse155 .cse106 .cse48 .cse152 .cse231 .cse232 .cse6 .cse14 .cse53 .cse113 .cse233))) (.cse134 (or .cse367 .cse136)) (.cse135 (or (and .cse405 .cse113) .cse26)) (.cse201 (or .cse376 .cse42)) (.cse215 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse402 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse403 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse404 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse402 .cse359) (bvule .cse403 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse404) (bvule .cse402 .cse404) (bvule .cse403 .cse404)))) .cse16)) (.cse311 (or .cse16 (and .cse110 .cse376 .cse106 .cse234 .cse60 .cse231 .cse6 .cse14 .cse297 .cse113 .cse172))) (.cse300 (or .cse106 .cse16 .cse298)) (.cse301 (or .cse401 .cse33)) (.cse302 (or .cse33 .cse400)) (.cse214 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse397 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse395 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse399 (select |c_#length| v_arrayElimCell_70)) (.cse398 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse396 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse395 .cse396) (bvule .cse397 .cse359) (bvule .cse398 .cse399) (bvule .cse397 .cse399) (bvule .cse395 .cse399) (bvule .cse398 .cse396)))) .cse16)) (.cse151 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse394 (select |c_#length| v_arrayElimCell_70)) (.cse393 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse393 .cse394) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse394) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse394) (bvule .cse393 (select |c_#length| v_arrayElimCell_73))))) .cse16)) (.cse308 (or .cse392 .cse33)) (.cse296 (or (and .cse110 .cse106 .cse231 .cse6 .cse14 .cse297 .cse113 .cse172) .cse16)) (.cse235 (or .cse33 .cse391)) (.cse156 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse386 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse387 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse390 (select |c_#length| v_arrayElimCell_70)) (.cse389 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse388 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse386 (select |c_#length| v_arrayElimCell_66)) (bvule .cse387 .cse388) (bvule .cse389 .cse390) (bvule .cse386 .cse390) (bvule .cse387 .cse390) (bvule .cse389 .cse388)))) .cse16)) (.cse237 (or .cse33 .cse385)) (.cse313 (or .cse106 .cse105 .cse16)) (.cse154 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse382 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse384 (select |c_#length| v_arrayElimCell_70)) (.cse383 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (bvule .cse382 (select |c_#length| v_arrayElimCell_66)) (bvule .cse383 .cse384) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73) (bvule .cse382 .cse384) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse384) (bvule .cse383 (select |c_#length| v_arrayElimCell_73))))) .cse16)) (.cse316 (or .cse381 .cse33)) (.cse159 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse377 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse380 (select |c_#length| v_arrayElimCell_70)) (.cse379 (bvadd v_arrayElimCell_71 (_ bv4 32))) (.cse378 (select |c_#length| v_arrayElimCell_73))) (or (bvule .cse377 .cse378) (bvule .cse379 .cse380) (bvule (bvadd v_arrayElimCell_68 (_ bv4 32)) .cse380) (bvule .cse377 .cse380) (bvule .cse379 .cse378)))) .cse16)) (.cse240 (and .cse376 .cse60))) (and (or (and .cse87 .cse88) .cse16) .cse89 .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 .cse99 .cse100 (or (let ((.cse129 (and .cse137 (or .cse42 .cse105)))) (and (or .cse101 .cse42) .cse102 (or (and .cse101 .cse103) .cse26) .cse104 .cse6 (or .cse86 .cse42 .cse105) (or .cse42 .cse106 .cse105) .cse107 (or .cse42 .cse108) .cse9 .cse109 .cse110 .cse87 (or (and .cse111 .cse104) .cse26) .cse112 .cse113 .cse108 .cse114 (or .cse42 (and .cse115 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse116 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse116 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_71 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse117 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse119 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse117 .cse118) (bvule (bvadd v_arrayElimCell_71 (_ bv4 32)) .cse119) (bvule .cse116 .cse119) (bvule .cse117 .cse119))))))) .cse120 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse121 (bvadd v_arrayElimCell_68 (_ bv4 32)))) (or (bvule .cse121 (select |c_#length| v_arrayElimCell_66)) (forall ((v_arrayElimCell_73 (_ BitVec 32))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32))) (let ((.cse122 (bvadd v_arrayElimCell_71 (_ bv4 32)))) (or (forall ((v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse123 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse122 .cse123) (bvule .cse121 .cse123) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_72 (_ bv4 32)) .cse123))))) (bvule .cse122 (select |c_#length| v_arrayElimCell_73))))) (= |c_ULTIMATE.start_main_~root~0#1.base| v_arrayElimCell_73)))))))) .cse124 .cse125 .cse126 .cse127 .cse128 (or .cse129 .cse130) (or .cse26 .cse131) .cse132 .cse133 .cse101 .cse11 .cse134 .cse88 .cse135 .cse14 (or .cse136 .cse129))) .cse16) .cse138 .cse139 .cse140 .cse141 .cse142 (or .cse33 .cse42 .cse143) .cse144 .cse145 .cse146 .cse147 .cse148 .cse149 .cse150 (or .cse42 (and .cse151 .cse152 .cse153 .cse154 .cse101 .cse115 .cse155 .cse120 .cse156 .cse157 .cse158 .cse159 .cse113)) .cse160 .cse161 .cse162 .cse163 .cse164 .cse165 (or .cse42 (and .cse166 .cse167 .cse168)) .cse169 (or (and .cse170 .cse171 (or .cse42 .cse172)) .cse16) .cse173 (or .cse42 (and .cse157 .cse174 .cse175)) (or (and .cse176 (or (and .cse177 .cse178 .cse179 .cse180 .cse181 .cse182) .cse16) .cse183 .cse184 (or .cse185 .cse16) .cse186 .cse187 .cse180 .cse188 .cse189 .cse190 .cse191 .cse192 .cse193 .cse177 .cse194 .cse195 .cse196 .cse197 .cse198 .cse199) .cse42) .cse200 (or (and .cse201 (or (and .cse42 .cse202 .cse203) .cse204) (or (and .cse205 .cse60 .cse206 .cse166 .cse207 .cse168) .cse26) .cse60 .cse206 (or (and .cse206 .cse207) .cse26) .cse208 .cse140 .cse209 .cse166 .cse168 .cse207) .cse16) .cse210 (or .cse42 (and .cse211 .cse212 .cse151 .cse152 .cse213 .cse214 .cse146 .cse155 .cse157 .cse158 .cse159 .cse215 .cse113)) .cse216 (or .cse42 (and .cse176 .cse183 (or (and .cse217 .cse218 .cse198 .cse188 .cse219) .cse16) (or .cse33 (and .cse184 .cse220)) .cse184 .cse186 .cse187 .cse180 .cse220 .cse188 .cse219 .cse190 .cse191 .cse192 .cse193 .cse177 .cse221 .cse194 .cse195 .cse196 (or (and .cse178 .cse179 .cse184 .cse222 .cse180 .cse220 .cse181 .cse223 .cse177 .cse221 .cse194 .cse224 .cse182) .cse16) .cse197 .cse198 .cse199)) (or .cse225 .cse26 .cse16) .cse226 .cse227 .cse228 .cse229 .cse230 .cse207 (or .cse42 (and .cse47 (or (and .cse155 .cse106 .cse48 .cse152 .cse231 .cse232 .cse53 .cse233) .cse16) .cse151 .cse48 .cse234 .cse6 .cse53 .cse54 .cse110 .cse155 .cse56 .cse235 .cse60 .cse236 .cse113 .cse237 .cse152 .cse49 .cse72 .cse50 .cse238 .cse52 .cse167 .cse239 .cse55 (or .cse16 .cse240) .cse73 .cse157 .cse159 (or .cse33 .cse241) .cse14)) .cse242 (or .cse42 (and .cse115 .cse154)) .cse243 .cse244 .cse245 (or .cse246 (and .cse242 .cse247 .cse243 .cse91 .cse244 .cse248 .cse245 .cse249 .cse109 .cse95 .cse96 .cse250 .cse251 .cse252 .cse253 .cse254 .cse99 .cse255 .cse256 .cse257 .cse138 .cse258 .cse259 .cse141 .cse132 .cse260 .cse261 .cse142 .cse145 .cse262 .cse263 .cse148 .cse264 .cse149 .cse265 .cse266 .cse267 .cse268 .cse269 .cse270 .cse271 .cse272 .cse161 .cse273 .cse274 .cse275 .cse276 .cse277 .cse278 .cse162 .cse163 .cse279 .cse280 .cse281 .cse282 .cse283 .cse284 .cse285 .cse210 .cse286 .cse287 .cse216 .cse288 .cse289 .cse228 .cse290 .cse291 .cse230 .cse292)) .cse109 .cse293 .cse294 (or .cse42 (and .cse211 .cse212 .cse151 .cse6 .cse155 .cse295 .cse296 .cse235 .cse215 .cse113 (or .cse297 .cse16 .cse298) .cse237 .cse299 .cse152 .cse72 .cse300 .cse301 .cse213 .cse302 .cse214 .cse55 .cse73 .cse146 (or .cse33 .cse106 .cse298) .cse157 .cse159 .cse14)) .cse303 .cse251 .cse304 .cse255 .cse305 .cse257 (or .cse42 (and .cse47 .cse151 .cse306 .cse48 .cse234 .cse104 (or .cse33 .cse307 .cse105) .cse308 .cse53 .cse153 .cse276 .cse54 .cse155 .cse309 .cse56 .cse120 .cse235 .cse156 .cse60 .cse310 .cse113 .cse311 (or .cse312 .cse105 .cse16) .cse237 .cse313 .cse152 .cse49 .cse50 .cse52 .cse167 .cse154 .cse55 .cse101 .cse115 .cse314 (or .cse315 .cse105 .cse16) .cse316 (or .cse33 .cse317 .cse105) .cse157 .cse159 .cse14 .cse318 (or .cse319 .cse105 .cse16))) (or .cse42 (and .cse151 .cse152 (or .cse33 (and .cse320 .cse321)))) (or (and (or (and .cse178 .cse322) .cse26) (or (and .cse323 .cse177 .cse178 .cse179 .cse184 .cse194 .cse224 .cse180) .cse42) (or .cse324 .cse26) (or .cse217 .cse42) .cse184 .cse325 .cse218 .cse220 .cse188 (or .cse326 .cse26) .cse217 .cse221 (or .cse323 .cse42) .cse327 (or .cse26 (and .cse184 .cse322)) .cse194 (or .cse328 .cse26) .cse198 .cse329 (or .cse330 .cse26) (or (and .cse331 .cse323 .cse178 .cse326 .cse332 .cse322) .cse26) (or (and .cse217 .cse198 .cse188) .cse42) (or .cse42 (and .cse177 .cse178)) (or (and .cse333 .cse334 .cse198 .cse188) .cse26) .cse178 .cse335 (or (and .cse333 .cse217 .cse334 .cse198) .cse26) .cse222 (or .cse331 .cse26) .cse180 (or .cse42 (and .cse217 .cse188)) .cse219 .cse223 (or .cse42 (and .cse323 .cse177 .cse178 .cse184)) (or .cse42 .cse185) .cse323 (or .cse42 .cse178) .cse177 (or .cse42 (and .cse323 .cse177 .cse217 .cse178 .cse179 .cse184 .cse194 .cse224 .cse198 .cse180 .cse188)) (or .cse336 .cse26) (or (and .cse333 .cse217) .cse26) .cse337 (or (and .cse194 .cse338) .cse26)) .cse16) .cse339 .cse340 (or (and .cse211 .cse212 .cse102 .cse6 .cse107 .cse9 .cse110 .cse295 .cse87 .cse341 .cse342 .cse112 .cse113 .cse114 .cse124 .cse126 .cse299 .cse127 .cse343 .cse344 .cse133 .cse213 .cse345 .cse346 .cse11 .cse134 .cse88 .cse135 .cse14) .cse16) .cse259 .cse132 .cse260 (or (and .cse201 .cse166 .cse168) .cse16) (or .cse33 .cse42 .cse347) (or (let ((.cse351 (and .cse348 .cse349))) (and .cse348 .cse349 (or .cse350 .cse26) (or .cse42 .cse351) (or .cse349 .cse26) (or .cse351 .cse26) .cse350 .cse254 .cse352 (or .cse42 (and .cse350 .cse352)))) .cse16) .cse211 .cse353 (or .cse42 (and .cse354 .cse166 .cse167 .cse168)) .cse272 (or (and .cse355 .cse356) .cse26) .cse275 .cse277 .cse278 .cse279 (or .cse42 (and .cse211 (or .cse33 .cse317 .cse298) .cse357 .cse212 .cse47 .cse151 .cse48 .cse234 .cse53 .cse54 (or .cse60 .cse16 .cse298) .cse155 .cse295 .cse56 .cse235 .cse341 .cse60 .cse215 (or .cse312 .cse16 .cse298) .cse113 .cse311 (or .cse33 .cse307 .cse298) .cse237 .cse152 .cse49 .cse300 (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (let ((.cse358 (bvadd v_arrayElimCell_68 (_ bv4 32))) (.cse360 (bvadd v_arrayElimCell_72 (_ bv4 32))) (.cse361 (select |c_#length| v_arrayElimCell_70))) (or (bvule .cse358 .cse359) (bvule .cse360 .cse118) (bvule .cse358 .cse361) (bvule .cse360 .cse361)))) .cse16) .cse50 .cse52 .cse167 .cse301 .cse213 .cse302 .cse214 .cse55 .cse346 .cse146 .cse157 .cse362 .cse159 (or .cse319 .cse16 .cse298) .cse14 (or .cse315 .cse16 .cse298))) (or .cse42 (and (or .cse105 .cse297 .cse16) .cse151 .cse104 .cse6 .cse308 .cse153 .cse155 .cse296 .cse120 .cse235 .cse156 .cse113 .cse125 .cse237 .cse313 .cse152 .cse72 (or .cse33 .cse106 .cse105) .cse154 .cse55 .cse101 .cse115 .cse73 .cse316 .cse157 .cse159 .cse14)) (or (and (or .cse42 .cse231) .cse174 .cse175) .cse16) .cse363 .cse364 .cse283 (or (and .cse365 (or (and .cse56 .cse234 .cse60 .cse167) .cse42) .cse366 (or (and .cse234 .cse167) .cse42) (or .cse16 (and .cse365 (or .cse367 .cse204) (or (and .cse234 .cse60 .cse368 .cse369) .cse26) .cse370 (or .cse42 .cse240) .cse371 .cse234 .cse60)) .cse370 .cse371 .cse167) .cse32) .cse372 (or .cse42 (and .cse354 .cse56 .cse60 .cse166 .cse167 .cse168)) .cse284 .cse373 (or (and .cse271 .cse249) .cse26) .cse374 .cse288 .cse289 .cse375 .cse292 (or .cse42 (and .cse110 (or .cse110 .cse16) .cse108)))))) (or .cse413 .cse26 .cse16) .cse44 (or .cse246 (and .cse242 .cse247 .cse91 .cse248 .cse109 .cse355 .cse96 .cse250 .cse251 .cse252 .cse253 .cse254 .cse100 .cse256 .cse258 (or .cse19 (and .cse267 .cse160 .cse89 .cse90 .cse271 .cse269 .cse92 .cse293 .cse94 .cse164 .cse303 .cse165 .cse98 .cse254 .cse304 .cse305 .cse169 .cse281 .cse363 .cse364 .cse173 .cse139 .cse372 .cse339 .cse340 .cse200 .cse374 .cse227 .cse375 .cse150)) .cse132 .cse260 .cse261 (or .cse42 (and .cse211 .cse401 .cse357 .cse212 .cse48 .cse234 .cse400 .cse152 .cse317 .cse53 .cse213 .cse346 (or .cse307 .cse298) .cse155 .cse295 .cse341 .cse362 .cse60 .cse391 .cse307 (or .cse317 .cse298) .cse385 .cse14 .cse113)) .cse145 .cse144 .cse262 .cse263 .cse146 (or .cse44 (and .cse242 .cse243 .cse91 .cse244 .cse248 .cse245 .cse249 .cse93 .cse109 .cse95 .cse96 .cse294 .cse208 .cse250 .cse97 .cse251 (or (and .cse414 .cse415 .cse125 .cse111 .cse416 .cse128 .cse405 .cse104 .cse417 .cse6 .cse132 .cse101 .cse110 .cse418 .cse87 .cse419 .cse420 .cse103 .cse112 .cse406 .cse14 .cse113 .cse108 .cse131) .cse16) .cse254 .cse99 .cse255 .cse257 .cse138 .cse140 .cse259 .cse141 .cse132 .cse260 .cse142 .cse145 .cse263 .cse354 (or .cse42 (and .cse381 .cse421 .cse48 .cse306 .cse234 .cse152 .cse104 .cse317 .cse53 .cse101 .cse115 .cse392 .cse422 .cse314 .cse155 .cse309 .cse120 .cse310 .cse60 .cse391 .cse307 .cse385 .cse14 .cse113)) .cse148 .cse264 .cse149 .cse265 .cse267 .cse270 .cse271 .cse269 .cse272 .cse161 .cse275 (or (and .cse205 .cse60 .cse206 .cse166 .cse168 .cse207) .cse16) .cse277 .cse278 .cse162 .cse163 .cse279 .cse281 .cse283 .cse209 .cse284 (or (and .cse381 .cse125 .cse106 .cse152 .cse104 .cse6 .cse101 .cse115 .cse392 .cse155 .cse120 .cse391 .cse385 .cse14 .cse113) .cse42) .cse210 .cse216 .cse288 (or .cse115 .cse42) .cse289 .cse228 .cse290 .cse291 .cse229 .cse230 .cse207 .cse292)) .cse147 (or (and .cse211 .cse212 .cse155 .cse152 .cse213 .cse113) .cse42) .cse264 .cse265 .cse266 .cse211 .cse353 .cse268 .cse270 .cse271 .cse272 .cse273 .cse356 .cse274 .cse276 (or .cse42 (and .cse211 .cse401 .cse212 .cse106 .cse299 .cse400 .cse152 .cse6 .cse213 .cse155 .cse295 .cse391 .cse385 .cse14 .cse113)) .cse280 .cse282 .cse283 (or (and .cse365 .cse366 (or (and .cse370 .cse234 .cse60 .cse368 .cse423 .cse369) .cse16) .cse370 .cse371 .cse167 (or .cse42 (and .cse234 .cse60))) .cse32) .cse284 .cse373 .cse285 .cse210 .cse286 .cse287 .cse424 .cse288 .cse226 (or (and .cse415 .cse211 .cse212 .cse416 .cse299 .cse344 .cse343 .cse405 .cse6 .cse213 .cse345 .cse346 .cse110 .cse418 .cse295 .cse87 .cse341 .cse342 .cse420 .cse112 .cse406 .cse14 .cse113) .cse16) (or (and .cse267 .cse243 .cse271 .cse269 .cse161 .cse244 .cse245 .cse275 .cse249 .cse277 .cse278 .cse95 .cse162 .cse163 .cse279 .cse254 .cse99 .cse255 .cse257 .cse281 .cse138 .cse259 .cse141 .cse142 .cse216 .cse289 .cse228 .cse148 .cse230 .cse149) .cse19) .cse290 .cse291 .cse292)) .cse42 (or (and .cse38 .cse72 .cse5 .cse6 .cse30 .cse40 .cse55 .cse36 .cse73 .cse57 .cse75 (or .cse7 .cse74) .cse37 .cse61 .cse14) .cse42) .cse76 (or .cse7 .cse425) (or (and (or .cse426 .cse16) (or (and .cse427 .cse60) .cse16)) .cse26) .cse246 (or .cse33 (and .cse428 (or .cse7 .cse429))) (or .cse246 (and (or .cse64 (and .cse46 (or .cse42 .cse51) (or (and (or .cse430 (and .cse431 .cse51)) .cse427 .cse60 .cse51 .cse432) .cse16) .cse69 .cse70 (or .cse42 (and .cse60 .cse51)))) (or .cse42 (and .cse48 .cse433 (or (and .cse36 .cse434 .cse48 .cse433 .cse60 .cse5 .cse307 .cse317 .cse51 .cse14 .cse53 .cse40) .cse59) .cse5 .cse317 .cse51 .cse53 .cse40 .cse36 .cse434 .cse60 .cse307 .cse14)) (or (and .cse1 .cse2 .cse63 .cse29 (or .cse42 .cse62) .cse30) .cse64) (or .cse42 (and .cse36 .cse434 .cse106 .cse433 .cse5 (or .cse59 (and .cse36 .cse434 .cse106 .cse433 .cse5 .cse6 .cse14 .cse40)) .cse6 .cse14 .cse40)) .cse65 (or .cse59 (and (or .cse36 .cse42) .cse66)) (or (and (or (and .cse435 .cse436 .cse437 .cse438 .cse179 .cse194 .cse439 .cse440 .cse198 .cse180 .cse441 .cse442) .cse42) .cse81 .cse79 (or (and .cse435 .cse437 .cse443 .cse444 .cse445 .cse446 .cse442 .cse447 .cse448 .cse194 .cse449 .cse450 .cse198 .cse451 .cse441 .cse452 .cse453 .cse454 .cse436 .cse440 .cse180 .cse455 .cse456 .cse457 .cse438 .cse439) .cse16) (or .cse42 (and .cse435 .cse437 .cse179 .cse194 .cse439 .cse440 .cse198 .cse180 .cse441)) .cse25 .cse458) .cse19) (or (and .cse36 .cse5 (or (and .cse36 .cse5 .cse40) .cse59) .cse40) .cse42) (or .cse42 (and .cse36 .cse459 .cse460)) .cse34 .cse77 (or .cse16 (let ((.cse461 (or .cse430 .cse469)) (.cse462 (or .cse430 (and .cse13 .cse468))) (.cse463 (or .cse430 .cse467)) (.cse466 (or (and .cse62 .cse5) .cse430))) (and .cse461 .cse462 .cse463 .cse464 .cse13 .cse5 (or .cse59 (and .cse461 .cse462 .cse463 .cse464 .cse13 .cse5 .cse6 .cse465 .cse14 .cse466)) .cse6 .cse465 .cse14 .cse466))) .cse78 .cse82 (or (and .cse48 .cse106 .cse433 .cse5 .cse6 .cse317 .cse51 .cse53 .cse40 .cse36 .cse434 .cse470 .cse62 .cse60 .cse13 .cse307 .cse471 .cse14) .cse42) .cse83 .cse84 .cse80 .cse25 .cse458)) (or (and .cse45 .cse46 (or .cse7 .cse58) .cse47 .cse48 .cse49 .cse38 .cse5 .cse50 .cse51 .cse52 .cse30 .cse53 .cse40 .cse54 .cse55 .cse36 .cse56 .cse57 .cse60 .cse37 .cse61 .cse14) .cse42) (or (and .cse46 .cse67 .cse68 .cse69 .cse71 (or .cse426 .cse26)) .cse32)))))))) is different from true