./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa --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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:26:51,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:26:51,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:26:51,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:26:51,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:26:51,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:26:51,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:26:51,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:26:51,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:26:51,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:26:51,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:26:51,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:26:51,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:26:51,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:26:51,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:26:51,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:26:51,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:26:51,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:26:51,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:26:51,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:26:51,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:26:51,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:26:51,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:26:51,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:26:51,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:26:51,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:26:51,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:26:51,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:26:51,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:26:51,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:26:51,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:26:51,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:26:51,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:26:51,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:26:51,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:26:51,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:26:51,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:26:51,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:26:51,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:26:51,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:26:51,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:26:51,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-07 00:26:51,663 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:26:51,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:26:51,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:26:51,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:26:51,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:26:51,665 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:26:51,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:26:51,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:26:51,665 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:26:51,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-07 00:26:51,666 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:26:51,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:26:51,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:26:51,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:26:51,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:26:51,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:26:51,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:26:51,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:26:51,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:26:51,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa 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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2021-12-07 00:26:51,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:26:51,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:26:51,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:26:51,863 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:26:51,864 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:26:51,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2021-12-07 00:26:51,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/6ea1926af/20787a3a0c9f443eb0cb05c2443f3b79/FLAGd89974f4b [2021-12-07 00:26:52,386 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:26:52,387 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2021-12-07 00:26:52,400 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/6ea1926af/20787a3a0c9f443eb0cb05c2443f3b79/FLAGd89974f4b [2021-12-07 00:26:52,414 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/6ea1926af/20787a3a0c9f443eb0cb05c2443f3b79 [2021-12-07 00:26:52,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:26:52,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:26:52,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:26:52,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:26:52,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:26:52,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:52" (1/1) ... [2021-12-07 00:26:52,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f5ddb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:52, skipping insertion in model container [2021-12-07 00:26:52,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:52" (1/1) ... [2021-12-07 00:26:52,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:26:52,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:26:52,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[33021,33034] [2021-12-07 00:26:52,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[49681,49694] [2021-12-07 00:26:52,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:26:52,835 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-07 00:26:52,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@13044b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:52, skipping insertion in model container [2021-12-07 00:26:52,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:26:52,836 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-07 00:26:52,837 INFO L158 Benchmark]: Toolchain (without parser) took 419.37ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 78.9MB in the end (delta: -2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 00:26:52,838 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:26:52,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.96ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 79.4MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 00:26:52,840 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.13ms. Allocated memory is still 117.4MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.96ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 79.4MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa --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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:26:54,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:26:54,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:26:54,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:26:54,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:26:54,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:26:54,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:26:54,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:26:54,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:26:54,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:26:54,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:26:54,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:26:54,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:26:54,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:26:54,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:26:54,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:26:54,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:26:54,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:26:54,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:26:54,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:26:54,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:26:54,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:26:54,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:26:54,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:26:54,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:26:54,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:26:54,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:26:54,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:26:54,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:26:54,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:26:54,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:26:54,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:26:54,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:26:54,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:26:54,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:26:54,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:26:54,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:26:54,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:26:54,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:26:54,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:26:54,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:26:54,311 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-07 00:26:54,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:26:54,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:26:54,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:26:54,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:26:54,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:26:54,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:26:54,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:26:54,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:26:54,339 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:26:54,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:26:54,340 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:26:54,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 00:26:54,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:26:54,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:26:54,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:26:54,341 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-07 00:26:54,341 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-07 00:26:54,341 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-07 00:26:54,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:26:54,341 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:26:54,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:26:54,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:26:54,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:26:54,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:26:54,343 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-07 00:26:54,343 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-07 00:26:54,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:26:54,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-07 00:26:54,343 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa 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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2021-12-07 00:26:54,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:26:54,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:26:54,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:26:54,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:26:54,606 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:26:54,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2021-12-07 00:26:54,647 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/c6fa34455/00e65878bd0a4238993ca9c8153e59f7/FLAG2c57bef12 [2021-12-07 00:26:55,158 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:26:55,159 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2021-12-07 00:26:55,174 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/c6fa34455/00e65878bd0a4238993ca9c8153e59f7/FLAG2c57bef12 [2021-12-07 00:26:55,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/data/c6fa34455/00e65878bd0a4238993ca9c8153e59f7 [2021-12-07 00:26:55,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:26:55,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:26:55,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:26:55,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:26:55,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:26:55,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:55" (1/1) ... [2021-12-07 00:26:55,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f42bc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:55, skipping insertion in model container [2021-12-07 00:26:55,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:55" (1/1) ... [2021-12-07 00:26:55,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:26:55,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:26:56,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[33021,33034] [2021-12-07 00:26:56,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[49681,49694] [2021-12-07 00:26:56,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:26:56,233 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-07 00:26:56,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:26:56,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[33021,33034] [2021-12-07 00:26:56,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[49681,49694] [2021-12-07 00:26:56,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:26:56,396 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:26:56,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[33021,33034] [2021-12-07 00:26:56,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[49681,49694] [2021-12-07 00:26:56,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:26:56,528 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:26:56,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56 WrapperNode [2021-12-07 00:26:56,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:26:56,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:26:56,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:26:56,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:26:56,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,633 INFO L137 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1578 [2021-12-07 00:26:56,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:26:56,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:26:56,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:26:56,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:26:56,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:26:56,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:26:56,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:26:56,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:26:56,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (1/1) ... [2021-12-07 00:26:56,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:26:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:26:56,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:26:56,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:26:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-07 00:26:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-07 00:26:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-07 00:26:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-07 00:26:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:26:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:26:56,970 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:26:56,971 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:26:56,975 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-07 00:27:01,840 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:27:01,854 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:27:01,854 INFO L301 CfgBuilder]: Removed 92 assume(true) statements. [2021-12-07 00:27:01,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:01 BoogieIcfgContainer [2021-12-07 00:27:01,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:27:01,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:27:01,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:27:01,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:27:01,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:26:55" (1/3) ... [2021-12-07 00:27:01,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b86d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:27:01, skipping insertion in model container [2021-12-07 00:27:01,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:56" (2/3) ... [2021-12-07 00:27:01,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b86d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:27:01, skipping insertion in model container [2021-12-07 00:27:01,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:01" (3/3) ... [2021-12-07 00:27:01,863 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-2.i [2021-12-07 00:27:01,867 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:27:01,867 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 834 error locations. [2021-12-07 00:27:01,900 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:27:01,905 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:27:01,906 INFO L340 AbstractCegarLoop]: Starting to check reachability of 834 error locations. [2021-12-07 00:27:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 1655 states, 813 states have (on average 2.2484624846248464) internal successors, (1828), 1646 states have internal predecessors, (1828), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-07 00:27:01,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:01,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-07 00:27:01,946 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2021-12-07 00:27:01,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:01,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632130103] [2021-12-07 00:27:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:01,959 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:01,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:01,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:01,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-07 00:27:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:02,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-07 00:27:02,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:02,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:02,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632130103] [2021-12-07 00:27:02,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632130103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:02,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:02,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:27:02,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262860628] [2021-12-07 00:27:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:02,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 00:27:02,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 00:27:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:27:02,142 INFO L87 Difference]: Start difference. First operand has 1655 states, 813 states have (on average 2.2484624846248464) internal successors, (1828), 1646 states have internal predecessors, (1828), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:02,247 INFO L93 Difference]: Finished difference Result 1637 states and 1731 transitions. [2021-12-07 00:27:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 00:27:02,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-07 00:27:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:02,272 INFO L225 Difference]: With dead ends: 1637 [2021-12-07 00:27:02,272 INFO L226 Difference]: Without dead ends: 1635 [2021-12-07 00:27:02,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:27:02,276 INFO L933 BasicCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:02,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:27:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2021-12-07 00:27:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2021-12-07 00:27:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 804 states have (on average 2.123134328358209) internal successors, (1707), 1626 states have internal predecessors, (1707), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1729 transitions. [2021-12-07 00:27:02,396 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1729 transitions. Word has length 5 [2021-12-07 00:27:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:02,397 INFO L470 AbstractCegarLoop]: Abstraction has 1635 states and 1729 transitions. [2021-12-07 00:27:02,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1729 transitions. [2021-12-07 00:27:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-07 00:27:02,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:02,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-07 00:27:02,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-07 00:27:02,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:02,599 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2021-12-07 00:27:02,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:02,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469298755] [2021-12-07 00:27:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:02,605 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:02,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:02,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-07 00:27:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:02,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:27:02,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:02,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:02,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:02,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469298755] [2021-12-07 00:27:02,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469298755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:02,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:02,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:27:02,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853916773] [2021-12-07 00:27:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:02,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:02,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:02,893 INFO L87 Difference]: Start difference. First operand 1635 states and 1729 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:05,152 INFO L93 Difference]: Finished difference Result 1891 states and 2028 transitions. [2021-12-07 00:27:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-07 00:27:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:05,160 INFO L225 Difference]: With dead ends: 1891 [2021-12-07 00:27:05,160 INFO L226 Difference]: Without dead ends: 1891 [2021-12-07 00:27:05,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:05,162 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 1369 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:05,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1380 Valid, 1533 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-07 00:27:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-07 00:27:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1620. [2021-12-07 00:27:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 880 states have (on average 1.9897727272727272) internal successors, (1751), 1611 states have internal predecessors, (1751), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1773 transitions. [2021-12-07 00:27:05,203 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1773 transitions. Word has length 5 [2021-12-07 00:27:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:05,203 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 1773 transitions. [2021-12-07 00:27:05,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1773 transitions. [2021-12-07 00:27:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-07 00:27:05,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:05,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-07 00:27:05,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-07 00:27:05,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:05,405 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:05,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2021-12-07 00:27:05,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106286859] [2021-12-07 00:27:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:05,407 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:05,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:05,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-07 00:27:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:05,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 00:27:05,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:05,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:05,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:05,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106286859] [2021-12-07 00:27:05,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106286859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:05,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:05,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:27:05,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398858794] [2021-12-07 00:27:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:05,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:05,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:05,514 INFO L87 Difference]: Start difference. First operand 1620 states and 1773 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:08,880 INFO L93 Difference]: Finished difference Result 2140 states and 2343 transitions. [2021-12-07 00:27:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:08,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-07 00:27:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:08,889 INFO L225 Difference]: With dead ends: 2140 [2021-12-07 00:27:08,889 INFO L226 Difference]: Without dead ends: 2140 [2021-12-07 00:27:08,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:08,890 INFO L933 BasicCegarLoop]: 1560 mSDtfsCounter, 741 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:08,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 2268 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-07 00:27:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-12-07 00:27:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1776. [2021-12-07 00:27:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1046 states have (on average 1.9665391969407267) internal successors, (2057), 1767 states have internal predecessors, (2057), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2079 transitions. [2021-12-07 00:27:08,930 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2079 transitions. Word has length 5 [2021-12-07 00:27:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:08,931 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 2079 transitions. [2021-12-07 00:27:08,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2079 transitions. [2021-12-07 00:27:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-07 00:27:08,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:08,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-07 00:27:08,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-07 00:27:09,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:09,132 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2021-12-07 00:27:09,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:09,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171034979] [2021-12-07 00:27:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:09,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:09,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:09,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-07 00:27:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:09,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:27:09,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:09,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:09,222 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:09,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171034979] [2021-12-07 00:27:09,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171034979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:09,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:09,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:09,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293743331] [2021-12-07 00:27:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:09,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:09,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:09,224 INFO L87 Difference]: Start difference. First operand 1776 states and 2079 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:09,336 INFO L93 Difference]: Finished difference Result 3336 states and 3931 transitions. [2021-12-07 00:27:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-07 00:27:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:09,351 INFO L225 Difference]: With dead ends: 3336 [2021-12-07 00:27:09,351 INFO L226 Difference]: Without dead ends: 3336 [2021-12-07 00:27:09,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:09,352 INFO L933 BasicCegarLoop]: 1854 mSDtfsCounter, 1377 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:09,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1388 Valid, 3471 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:27:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-12-07 00:27:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 1778. [2021-12-07 00:27:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1048 states have (on average 1.9646946564885497) internal successors, (2059), 1769 states have internal predecessors, (2059), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2081 transitions. [2021-12-07 00:27:09,402 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2081 transitions. Word has length 6 [2021-12-07 00:27:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:09,402 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 2081 transitions. [2021-12-07 00:27:09,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2081 transitions. [2021-12-07 00:27:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 00:27:09,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:09,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:09,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-07 00:27:09,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:09,605 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2021-12-07 00:27:09,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:09,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685685318] [2021-12-07 00:27:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:09,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:09,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:09,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-07 00:27:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:09,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:27:09,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:09,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:09,814 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:09,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685685318] [2021-12-07 00:27:09,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685685318] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:09,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:09,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:09,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214453519] [2021-12-07 00:27:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:09,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:09,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:09,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:09,815 INFO L87 Difference]: Start difference. First operand 1778 states and 2081 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:09,844 INFO L93 Difference]: Finished difference Result 1742 states and 2044 transitions. [2021-12-07 00:27:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-07 00:27:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:09,853 INFO L225 Difference]: With dead ends: 1742 [2021-12-07 00:27:09,853 INFO L226 Difference]: Without dead ends: 1742 [2021-12-07 00:27:09,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:09,854 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 1550 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:09,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1561 Valid, 1608 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:27:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2021-12-07 00:27:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1736. [2021-12-07 00:27:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1030 states have (on average 1.9572815533980583) internal successors, (2016), 1727 states have internal predecessors, (2016), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2038 transitions. [2021-12-07 00:27:09,898 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2038 transitions. Word has length 11 [2021-12-07 00:27:09,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:09,898 INFO L470 AbstractCegarLoop]: Abstraction has 1736 states and 2038 transitions. [2021-12-07 00:27:09,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2038 transitions. [2021-12-07 00:27:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-07 00:27:09,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:09,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:09,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-07 00:27:10,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:10,099 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2021-12-07 00:27:10,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:10,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525002644] [2021-12-07 00:27:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:10,100 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:10,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:10,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:10,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-07 00:27:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:10,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:27:10,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:10,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:10,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525002644] [2021-12-07 00:27:10,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525002644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:10,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:10,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:10,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416878619] [2021-12-07 00:27:10,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:10,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:10,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:10,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:10,235 INFO L87 Difference]: Start difference. First operand 1736 states and 2038 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2021-12-07 00:27:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:10,326 INFO L93 Difference]: Finished difference Result 1721 states and 2016 transitions. [2021-12-07 00:27:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:27:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2021-12-07 00:27:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:10,335 INFO L225 Difference]: With dead ends: 1721 [2021-12-07 00:27:10,335 INFO L226 Difference]: Without dead ends: 1721 [2021-12-07 00:27:10,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:10,337 INFO L933 BasicCegarLoop]: 1535 mSDtfsCounter, 1521 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:10,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 3091 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:27:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2021-12-07 00:27:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1714. [2021-12-07 00:27:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1022 states have (on average 1.9442270058708415) internal successors, (1987), 1705 states have internal predecessors, (1987), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2009 transitions. [2021-12-07 00:27:10,378 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2009 transitions. Word has length 13 [2021-12-07 00:27:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:10,379 INFO L470 AbstractCegarLoop]: Abstraction has 1714 states and 2009 transitions. [2021-12-07 00:27:10,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2021-12-07 00:27:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2009 transitions. [2021-12-07 00:27:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 00:27:10,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:10,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:10,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-07 00:27:10,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:10,581 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2021-12-07 00:27:10,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:10,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50786667] [2021-12-07 00:27:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:10,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:10,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:10,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-07 00:27:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:10,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 00:27:10,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:10,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:10,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:10,846 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:10,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50786667] [2021-12-07 00:27:10,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50786667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:10,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:10,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:10,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108906160] [2021-12-07 00:27:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:10,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:10,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:10,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:10,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:10,847 INFO L87 Difference]: Start difference. First operand 1714 states and 2009 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:14,280 INFO L93 Difference]: Finished difference Result 2759 states and 3092 transitions. [2021-12-07 00:27:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:27:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 00:27:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:14,290 INFO L225 Difference]: With dead ends: 2759 [2021-12-07 00:27:14,290 INFO L226 Difference]: Without dead ends: 2759 [2021-12-07 00:27:14,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:14,291 INFO L933 BasicCegarLoop]: 800 mSDtfsCounter, 3206 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3214 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:14,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3214 Valid, 1886 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-07 00:27:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2021-12-07 00:27:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1710. [2021-12-07 00:27:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1022 states have (on average 1.9403131115459882) internal successors, (1983), 1701 states have internal predecessors, (1983), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2005 transitions. [2021-12-07 00:27:14,319 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2005 transitions. Word has length 27 [2021-12-07 00:27:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:14,319 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 2005 transitions. [2021-12-07 00:27:14,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2005 transitions. [2021-12-07 00:27:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 00:27:14,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:14,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:14,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-07 00:27:14,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:14,521 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2021-12-07 00:27:14,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:14,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451757715] [2021-12-07 00:27:14,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:14,522 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:14,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:14,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-07 00:27:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:14,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:27:14,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:14,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:14,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:14,760 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:14,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451757715] [2021-12-07 00:27:14,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451757715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:14,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:14,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:14,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182713926] [2021-12-07 00:27:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:14,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:14,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:14,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:14,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:14,762 INFO L87 Difference]: Start difference. First operand 1710 states and 2005 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:19,254 INFO L93 Difference]: Finished difference Result 2278 states and 2483 transitions. [2021-12-07 00:27:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:27:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 00:27:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:19,262 INFO L225 Difference]: With dead ends: 2278 [2021-12-07 00:27:19,262 INFO L226 Difference]: Without dead ends: 2278 [2021-12-07 00:27:19,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:19,263 INFO L933 BasicCegarLoop]: 1178 mSDtfsCounter, 1501 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:19,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1501 Valid, 2603 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-12-07 00:27:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2021-12-07 00:27:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1706. [2021-12-07 00:27:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1022 states have (on average 1.936399217221135) internal successors, (1979), 1697 states have internal predecessors, (1979), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2001 transitions. [2021-12-07 00:27:19,287 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2001 transitions. Word has length 27 [2021-12-07 00:27:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:19,287 INFO L470 AbstractCegarLoop]: Abstraction has 1706 states and 2001 transitions. [2021-12-07 00:27:19,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2001 transitions. [2021-12-07 00:27:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 00:27:19,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:19,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:19,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-07 00:27:19,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:19,490 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2021-12-07 00:27:19,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425956750] [2021-12-07 00:27:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:19,494 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:19,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:19,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-07 00:27:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:19,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:27:19,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:19,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:19,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:19,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425956750] [2021-12-07 00:27:19,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425956750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:19,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:19,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:19,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11914235] [2021-12-07 00:27:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:19,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:19,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:19,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:19,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:19,725 INFO L87 Difference]: Start difference. First operand 1706 states and 2001 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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) [2021-12-07 00:27:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:19,765 INFO L93 Difference]: Finished difference Result 1706 states and 1997 transitions. [2021-12-07 00:27:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:27:19,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 42 [2021-12-07 00:27:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:19,772 INFO L225 Difference]: With dead ends: 1706 [2021-12-07 00:27:19,772 INFO L226 Difference]: Without dead ends: 1706 [2021-12-07 00:27:19,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:19,773 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 1497 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:19,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1508 Valid, 3069 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:27:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2021-12-07 00:27:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1700. [2021-12-07 00:27:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1016 states have (on average 1.937992125984252) internal successors, (1969), 1691 states have internal predecessors, (1969), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 1991 transitions. [2021-12-07 00:27:19,792 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 1991 transitions. Word has length 42 [2021-12-07 00:27:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:19,792 INFO L470 AbstractCegarLoop]: Abstraction has 1700 states and 1991 transitions. [2021-12-07 00:27:19,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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) [2021-12-07 00:27:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 1991 transitions. [2021-12-07 00:27:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-07 00:27:19,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:19,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:19,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-07 00:27:19,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:19,994 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2021-12-07 00:27:19,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:19,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060786971] [2021-12-07 00:27:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:19,996 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:19,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:19,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-07 00:27:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:20,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:27:20,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:20,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:20,314 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060786971] [2021-12-07 00:27:20,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060786971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:20,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:20,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:20,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598806468] [2021-12-07 00:27:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:20,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:27:20,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:27:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:20,315 INFO L87 Difference]: Start difference. First operand 1700 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:20,469 INFO L93 Difference]: Finished difference Result 1941 states and 2241 transitions. [2021-12-07 00:27:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:27:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-12-07 00:27:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:20,476 INFO L225 Difference]: With dead ends: 1941 [2021-12-07 00:27:20,476 INFO L226 Difference]: Without dead ends: 1941 [2021-12-07 00:27:20,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:27:20,477 INFO L933 BasicCegarLoop]: 1608 mSDtfsCounter, 269 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:20,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 3012 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:27:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2021-12-07 00:27:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1746. [2021-12-07 00:27:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1062 states have (on average 1.8973634651600753) internal successors, (2015), 1737 states have internal predecessors, (2015), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2037 transitions. [2021-12-07 00:27:20,496 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2037 transitions. Word has length 50 [2021-12-07 00:27:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:20,497 INFO L470 AbstractCegarLoop]: Abstraction has 1746 states and 2037 transitions. [2021-12-07 00:27:20,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2037 transitions. [2021-12-07 00:27:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-07 00:27:20,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:20,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2021-12-07 00:27:20,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-07 00:27:20,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:20,700 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:20,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2021-12-07 00:27:20,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:20,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066469713] [2021-12-07 00:27:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:20,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:20,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:20,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-07 00:27:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:20,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 00:27:20,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:20,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:20,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:21,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:27:21,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 00:27:21,305 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 00:27:21,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 18 [2021-12-07 00:27:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:21,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:21,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066469713] [2021-12-07 00:27:21,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066469713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:21,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:21,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:27:21,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322408990] [2021-12-07 00:27:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:21,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:21,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:21,322 INFO L87 Difference]: Start difference. First operand 1746 states and 2037 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:24,403 INFO L93 Difference]: Finished difference Result 1933 states and 2208 transitions. [2021-12-07 00:27:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:27:24,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-12-07 00:27:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:24,411 INFO L225 Difference]: With dead ends: 1933 [2021-12-07 00:27:24,411 INFO L226 Difference]: Without dead ends: 1933 [2021-12-07 00:27:24,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:24,412 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 1569 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:24,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1585 Valid, 984 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-07 00:27:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2021-12-07 00:27:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1496. [2021-12-07 00:27:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 896 states have (on average 1.8013392857142858) internal successors, (1614), 1487 states have internal predecessors, (1614), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1636 transitions. [2021-12-07 00:27:24,433 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1636 transitions. Word has length 53 [2021-12-07 00:27:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:24,434 INFO L470 AbstractCegarLoop]: Abstraction has 1496 states and 1636 transitions. [2021-12-07 00:27:24,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1636 transitions. [2021-12-07 00:27:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:27:24,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:24,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:24,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-07 00:27:24,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:24,636 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2021-12-07 00:27:24,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:24,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873961938] [2021-12-07 00:27:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:24,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:24,642 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:24,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-07 00:27:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:24,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:27:24,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:25,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:25,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:25,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:25,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:25,054 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:25,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873961938] [2021-12-07 00:27:25,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873961938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:25,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:25,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:25,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85840324] [2021-12-07 00:27:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:25,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:27:25,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:27:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:25,055 INFO L87 Difference]: Start difference. First operand 1496 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:28,158 INFO L93 Difference]: Finished difference Result 1495 states and 1635 transitions. [2021-12-07 00:27:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:27:28,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-12-07 00:27:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:28,164 INFO L225 Difference]: With dead ends: 1495 [2021-12-07 00:27:28,164 INFO L226 Difference]: Without dead ends: 1495 [2021-12-07 00:27:28,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:27:28,165 INFO L933 BasicCegarLoop]: 1449 mSDtfsCounter, 4 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3704 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:28,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3704 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-07 00:27:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2021-12-07 00:27:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2021-12-07 00:27:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 896 states have (on average 1.8002232142857142) internal successors, (1613), 1486 states have internal predecessors, (1613), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1635 transitions. [2021-12-07 00:27:28,181 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1635 transitions. Word has length 58 [2021-12-07 00:27:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:28,181 INFO L470 AbstractCegarLoop]: Abstraction has 1495 states and 1635 transitions. [2021-12-07 00:27:28,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1635 transitions. [2021-12-07 00:27:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:27:28,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:28,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:28,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-07 00:27:28,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:28,383 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2021-12-07 00:27:28,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:28,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637928232] [2021-12-07 00:27:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:28,384 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:28,384 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:28,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-07 00:27:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:28,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 00:27:28,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:28,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:28,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:28,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:28,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:28,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:28,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:28,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:28,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637928232] [2021-12-07 00:27:28,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637928232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:28,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:28,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:28,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22597933] [2021-12-07 00:27:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:28,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:27:28,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:28,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:27:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:28,668 INFO L87 Difference]: Start difference. First operand 1495 states and 1635 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:32,843 INFO L93 Difference]: Finished difference Result 1494 states and 1634 transitions. [2021-12-07 00:27:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:27:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-12-07 00:27:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:32,848 INFO L225 Difference]: With dead ends: 1494 [2021-12-07 00:27:32,848 INFO L226 Difference]: Without dead ends: 1494 [2021-12-07 00:27:32,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:27:32,848 INFO L933 BasicCegarLoop]: 1449 mSDtfsCounter, 2 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3750 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:32,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 3750 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-12-07 00:27:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-12-07 00:27:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2021-12-07 00:27:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 895 states have (on average 1.8011173184357543) internal successors, (1612), 1485 states have internal predecessors, (1612), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 00:27:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1634 transitions. [2021-12-07 00:27:32,866 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1634 transitions. Word has length 58 [2021-12-07 00:27:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:32,866 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 1634 transitions. [2021-12-07 00:27:32,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1634 transitions. [2021-12-07 00:27:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-07 00:27:32,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:32,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:32,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-07 00:27:33,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:33,068 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2015085822, now seen corresponding path program 1 times [2021-12-07 00:27:33,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:33,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897660254] [2021-12-07 00:27:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:33,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:33,075 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:33,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-07 00:27:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:33,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:27:33,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:33,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:27:33,378 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897660254] [2021-12-07 00:27:33,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897660254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:27:33,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:27:33,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:27:33,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416693298] [2021-12-07 00:27:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:27:33,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:27:33,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:27:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:27:33,379 INFO L87 Difference]: Start difference. First operand 1494 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 00:27:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:33,421 INFO L93 Difference]: Finished difference Result 1497 states and 1639 transitions. [2021-12-07 00:27:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:27:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-12-07 00:27:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:33,426 INFO L225 Difference]: With dead ends: 1497 [2021-12-07 00:27:33,426 INFO L226 Difference]: Without dead ends: 1497 [2021-12-07 00:27:33,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:27:33,427 INFO L933 BasicCegarLoop]: 1448 mSDtfsCounter, 2 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:33,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4336 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:27:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-12-07 00:27:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2021-12-07 00:27:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 897 states have (on average 1.8004459308807135) internal successors, (1615), 1488 states have internal predecessors, (1615), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-07 00:27:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1639 transitions. [2021-12-07 00:27:33,445 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1639 transitions. Word has length 66 [2021-12-07 00:27:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:33,445 INFO L470 AbstractCegarLoop]: Abstraction has 1497 states and 1639 transitions. [2021-12-07 00:27:33,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 00:27:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1639 transitions. [2021-12-07 00:27:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-07 00:27:33,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:33,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:33,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-07 00:27:33,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:33,647 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1745990217, now seen corresponding path program 1 times [2021-12-07 00:27:33,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:33,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707268555] [2021-12-07 00:27:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:33,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:33,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:33,653 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:33,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-07 00:27:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:33,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 00:27:33,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:33,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:27:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:34,010 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:34,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707268555] [2021-12-07 00:27:34,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707268555] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:27:34,010 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:27:34,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-07 00:27:34,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009644711] [2021-12-07 00:27:34,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 00:27:34,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:27:34,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:27:34,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:27:34,011 INFO L87 Difference]: Start difference. First operand 1497 states and 1639 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:34,162 INFO L93 Difference]: Finished difference Result 1509 states and 1657 transitions. [2021-12-07 00:27:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:27:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2021-12-07 00:27:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:34,166 INFO L225 Difference]: With dead ends: 1509 [2021-12-07 00:27:34,166 INFO L226 Difference]: Without dead ends: 1509 [2021-12-07 00:27:34,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-12-07 00:27:34,167 INFO L933 BasicCegarLoop]: 1448 mSDtfsCounter, 20 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5775 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:34,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 5775 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:27:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2021-12-07 00:27:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1507. [2021-12-07 00:27:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 906 states have (on average 1.7991169977924946) internal successors, (1630), 1497 states have internal predecessors, (1630), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-07 00:27:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1654 transitions. [2021-12-07 00:27:34,188 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1654 transitions. Word has length 67 [2021-12-07 00:27:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:34,188 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 1654 transitions. [2021-12-07 00:27:34,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1654 transitions. [2021-12-07 00:27:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-07 00:27:34,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:34,189 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:34,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-07 00:27:34,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:34,390 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash 483699518, now seen corresponding path program 2 times [2021-12-07 00:27:34,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:34,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594323731] [2021-12-07 00:27:34,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:27:34,394 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:34,396 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:34,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-07 00:27:34,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:27:34,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:27:34,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:27:34,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:34,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:27:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:35,026 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594323731] [2021-12-07 00:27:35,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594323731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:27:35,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:27:35,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-07 00:27:35,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192625875] [2021-12-07 00:27:35,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 00:27:35,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 00:27:35,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 00:27:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-07 00:27:35,027 INFO L87 Difference]: Start difference. First operand 1507 states and 1654 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:35,616 INFO L93 Difference]: Finished difference Result 1528 states and 1686 transitions. [2021-12-07 00:27:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-07 00:27:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2021-12-07 00:27:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:35,620 INFO L225 Difference]: With dead ends: 1528 [2021-12-07 00:27:35,620 INFO L226 Difference]: Without dead ends: 1524 [2021-12-07 00:27:35,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-07 00:27:35,621 INFO L933 BasicCegarLoop]: 1451 mSDtfsCounter, 43 mSDsluCounter, 12993 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 14444 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:35,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 14444 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:27:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2021-12-07 00:27:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1516. [2021-12-07 00:27:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 915 states have (on average 1.794535519125683) internal successors, (1642), 1506 states have internal predecessors, (1642), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-07 00:27:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1666 transitions. [2021-12-07 00:27:35,638 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1666 transitions. Word has length 70 [2021-12-07 00:27:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:35,638 INFO L470 AbstractCegarLoop]: Abstraction has 1516 states and 1666 transitions. [2021-12-07 00:27:35,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1666 transitions. [2021-12-07 00:27:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-07 00:27:35,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:35,639 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:35,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-07 00:27:35,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:35,840 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 436758686, now seen corresponding path program 3 times [2021-12-07 00:27:35,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525423394] [2021-12-07 00:27:35,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 00:27:35,844 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:35,846 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:35,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-07 00:27:36,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-07 00:27:36,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:27:36,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-07 00:27:36,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:36,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:27:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:37,132 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:37,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525423394] [2021-12-07 00:27:37,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525423394] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:27:37,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:27:37,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-07 00:27:37,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928792032] [2021-12-07 00:27:37,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 00:27:37,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-07 00:27:37,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:37,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-07 00:27:37,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-07 00:27:37,133 INFO L87 Difference]: Start difference. First operand 1516 states and 1666 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:40,412 INFO L93 Difference]: Finished difference Result 1558 states and 1742 transitions. [2021-12-07 00:27:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-07 00:27:40,413 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2021-12-07 00:27:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:40,416 INFO L225 Difference]: With dead ends: 1558 [2021-12-07 00:27:40,416 INFO L226 Difference]: Without dead ends: 1552 [2021-12-07 00:27:40,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-07 00:27:40,417 INFO L933 BasicCegarLoop]: 1455 mSDtfsCounter, 138 mSDsluCounter, 17387 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 18842 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:40,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 18842 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-07 00:27:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2021-12-07 00:27:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1534. [2021-12-07 00:27:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 933 states have (on average 1.7845659163987138) internal successors, (1665), 1524 states have internal predecessors, (1665), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-07 00:27:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1689 transitions. [2021-12-07 00:27:40,437 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1689 transitions. Word has length 76 [2021-12-07 00:27:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:40,437 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 1689 transitions. [2021-12-07 00:27:40,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1689 transitions. [2021-12-07 00:27:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-07 00:27:40,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:40,438 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:40,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-07 00:27:40,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:40,639 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash -357348514, now seen corresponding path program 4 times [2021-12-07 00:27:40,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:40,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285425780] [2021-12-07 00:27:40,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-07 00:27:40,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:40,645 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:40,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-07 00:27:40,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-07 00:27:40,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:27:40,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-07 00:27:40,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:41,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:27:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:27:42,597 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:42,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285425780] [2021-12-07 00:27:42,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285425780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:27:42,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:27:42,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-07 00:27:42,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773366844] [2021-12-07 00:27:42,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 00:27:42,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-07 00:27:42,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:27:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-07 00:27:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-07 00:27:42,600 INFO L87 Difference]: Start difference. First operand 1534 states and 1689 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:55,080 INFO L93 Difference]: Finished difference Result 1614 states and 1822 transitions. [2021-12-07 00:27:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-07 00:27:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2021-12-07 00:27:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:27:55,083 INFO L225 Difference]: With dead ends: 1614 [2021-12-07 00:27:55,083 INFO L226 Difference]: Without dead ends: 1610 [2021-12-07 00:27:55,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-07 00:27:55,087 INFO L933 BasicCegarLoop]: 1468 mSDtfsCounter, 409 mSDsluCounter, 39413 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 40881 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-12-07 00:27:55,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 40881 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-12-07 00:27:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-12-07 00:27:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1568. [2021-12-07 00:27:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 967 states have (on average 1.7693898655635987) internal successors, (1711), 1558 states have internal predecessors, (1711), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-07 00:27:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1735 transitions. [2021-12-07 00:27:55,108 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1735 transitions. Word has length 88 [2021-12-07 00:27:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:27:55,108 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 1735 transitions. [2021-12-07 00:27:55,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:27:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1735 transitions. [2021-12-07 00:27:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-07 00:27:55,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:27:55,109 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:55,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-07 00:27:55,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:27:55,311 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:27:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 182176190, now seen corresponding path program 5 times [2021-12-07 00:27:55,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:27:55,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190107710] [2021-12-07 00:27:55,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 00:27:55,315 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:27:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:27:55,317 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:27:55,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-07 00:27:56,554 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-07 00:27:56,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:27:56,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-07 00:27:56,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:56,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:56,683 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 00:27:56,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 34 [2021-12-07 00:27:56,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:27:56,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 15 [2021-12-07 00:27:57,659 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1616) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:27:58,929 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 00:27:58,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 40 [2021-12-07 00:27:58,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-07 00:27:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-07 00:27:59,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:27:59,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))))) is different from false [2021-12-07 00:27:59,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:27:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190107710] [2021-12-07 00:27:59,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190107710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:27:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [973493343] [2021-12-07 00:27:59,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 00:27:59,219 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-07 00:27:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-07 00:27:59,220 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-07 00:27:59,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-12-07 00:29:09,727 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-07 00:29:09,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:29:09,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-07 00:29:09,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:29:09,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:10,068 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 00:29:10,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 29 [2021-12-07 00:29:10,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:10,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2021-12-07 00:29:10,327 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2049) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:10,845 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2061) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:11,766 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2084) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:11,792 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2085 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2085) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:12,130 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 00:29:12,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 [2021-12-07 00:29:12,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-07 00:29:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2021-12-07 00:29:12,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:29:12,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [973493343] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:29:12,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:29:12,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 13 [2021-12-07 00:29:12,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545276275] [2021-12-07 00:29:12,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 00:29:12,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 00:29:12,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:29:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 00:29:12,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=98, Unknown=17, NotChecked=150, Total=306 [2021-12-07 00:29:12,398 INFO L87 Difference]: Start difference. First operand 1568 states and 1735 transitions. Second operand has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 00:29:12,480 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1616) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:29:14,447 INFO L93 Difference]: Finished difference Result 1892 states and 2047 transitions. [2021-12-07 00:29:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:29:14,448 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-12-07 00:29:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:29:14,451 INFO L225 Difference]: With dead ends: 1892 [2021-12-07 00:29:14,451 INFO L226 Difference]: Without dead ends: 1888 [2021-12-07 00:29:14,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 123 SyntacticMatches, 88 SemanticMatches, 17 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=43, Invalid=99, Unknown=18, NotChecked=182, Total=342 [2021-12-07 00:29:14,452 INFO L933 BasicCegarLoop]: 872 mSDtfsCounter, 1131 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 14376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13523 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:29:14,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 4289 Invalid, 14376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 841 Invalid, 0 Unknown, 13523 Unchecked, 2.0s Time] [2021-12-07 00:29:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2021-12-07 00:29:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1616. [2021-12-07 00:29:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1015 states have (on average 1.7330049261083744) internal successors, (1759), 1605 states have internal predecessors, (1759), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-07 00:29:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1783 transitions. [2021-12-07 00:29:14,469 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1783 transitions. Word has length 110 [2021-12-07 00:29:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:29:14,470 INFO L470 AbstractCegarLoop]: Abstraction has 1616 states and 1783 transitions. [2021-12-07 00:29:14,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 00:29:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1783 transitions. [2021-12-07 00:29:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-07 00:29:14,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:29:14,470 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:29:14,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-07 00:29:14,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2021-12-07 00:29:14,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-07 00:29:14,872 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-07 00:29:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 182176191, now seen corresponding path program 1 times [2021-12-07 00:29:14,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:29:14,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398509321] [2021-12-07 00:29:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:14,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:29:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:29:14,874 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:29:14,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-07 00:29:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:29:15,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-07 00:29:15,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:29:15,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:15,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:15,555 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 00:29:15,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-07 00:29:15,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:15,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:15,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-12-07 00:29:15,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-07 00:29:15,702 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:15,763 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:15,771 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:15,779 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32)))) is different from true [2021-12-07 00:29:15,786 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:15,795 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:15,804 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515)))) is different from true [2021-12-07 00:29:15,867 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:15,876 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:15,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525)))) is different from true [2021-12-07 00:29:15,894 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:15,904 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:15,914 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:15,949 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534)))) is different from true [2021-12-07 00:29:15,958 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2021-12-07 00:29:15,967 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539)))) is different from true [2021-12-07 00:29:15,976 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540)))) is different from true [2021-12-07 00:29:16,007 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:16,061 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:16,070 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,079 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555)))) is different from true [2021-12-07 00:29:16,088 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,097 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558)))) is different from true [2021-12-07 00:29:16,105 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560)))) is different from true [2021-12-07 00:29:16,114 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,122 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,134 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567)))) is different from true [2021-12-07 00:29:16,142 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,151 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571)))) is different from true [2021-12-07 00:29:16,160 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,168 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,177 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,185 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:16,194 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2581) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:29:16,202 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583)))) is different from true [2021-12-07 00:29:16,209 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:29:16,240 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 00:29:16,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:16,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:16,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:16,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:29:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2021-12-07 00:29:16,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:29:16,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-07 00:29:16,952 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:29:16,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398509321] [2021-12-07 00:29:16,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398509321] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:29:16,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [940364677] [2021-12-07 00:29:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:16,953 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-07 00:29:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-07 00:29:16,954 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-07 00:29:16,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a127a240-1a9a-4f69-a2de-96c27f4cf75c/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-12-07 00:31:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:31:05,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-07 00:31:05,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:31:05,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,139 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 00:31:05,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 17 [2021-12-07 00:31:05,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-12-07 00:31:05,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-07 00:31:05,249 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,284 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,292 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044)))) is different from true [2021-12-07 00:31:05,301 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,309 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,318 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,327 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,336 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,344 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056)))) is different from true [2021-12-07 00:31:05,353 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,362 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060)))) is different from true [2021-12-07 00:31:05,371 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,381 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065)))) is different from true [2021-12-07 00:31:05,416 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32)))) is different from true [2021-12-07 00:31:05,431 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070)))) is different from true [2021-12-07 00:31:05,440 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,449 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074)))) is different from true [2021-12-07 00:31:05,481 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078)))) is different from true [2021-12-07 00:31:05,490 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,498 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,507 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,516 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,525 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,533 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091)))) is different from true [2021-12-07 00:31:05,542 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,550 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3094 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3094) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3095 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3095) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,559 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3097) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3096 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3096)))) is different from true [2021-12-07 00:31:05,567 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,575 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3101 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3101) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3100) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,584 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,592 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,600 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3106) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107)))) is different from true [2021-12-07 00:31:05,609 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,618 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,627 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,636 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,648 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117)))) is different from true [2021-12-07 00:31:05,657 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3118) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:05,666 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,674 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3123 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3123))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3122 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3122) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,683 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3124) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:05,715 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 00:31:05,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-07 00:31:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2021-12-07 00:31:05,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:31:06,302 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-07 00:31:06,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [940364677] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:31:06,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 00:31:06,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 49] total 85 [2021-12-07 00:31:06,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086147603] [2021-12-07 00:31:06,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 00:31:06,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2021-12-07 00:31:06,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:31:06,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-12-07 00:31:06,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=160, Unknown=85, NotChecked=7584, Total=8010 [2021-12-07 00:31:06,312 INFO L87 Difference]: Start difference. First operand 1616 states and 1783 transitions. Second operand has 86 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 86 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 00:31:06,627 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.base|))) is different from true [2021-12-07 00:31:06,632 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:06,639 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:06,651 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:06,662 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:06,673 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:06,685 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:06,697 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-07 00:31:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:31:13,421 INFO L93 Difference]: Finished difference Result 1896 states and 2055 transitions. [2021-12-07 00:31:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 00:31:13,422 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 86 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2021-12-07 00:31:13,422 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2021-12-07 00:31:13,422 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 86 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110