./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.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_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/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_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/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_b0fb189b-55de-4c89-95fb-2872568e1140/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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:18:51,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:18:51,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:18:51,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:18:51,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:18:51,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:18:51,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:18:51,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:18:51,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:18:51,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:18:51,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:18:51,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:18:51,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:18:51,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:18:51,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:18:51,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:18:51,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:18:51,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:18:51,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:18:51,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:18:51,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:18:51,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:18:51,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:18:51,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:18:51,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:18:51,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:18:51,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:18:51,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:18:51,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:18:51,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:18:51,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:18:51,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:18:51,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:18:51,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:18:51,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:18:51,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:18:51,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:18:51,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:18:51,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:18:51,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:18:51,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:18:51,835 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 22:18:51,850 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:18:51,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:18:51,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:18:51,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:18:51,851 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:18:51,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:18:51,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:18:51,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:18:51,852 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:18:51,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 22:18:51,853 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:18:51,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:18:51,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:18:51,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:18:51,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:18:51,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:18:51,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:18:51,855 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:18:51,855 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_b0fb189b-55de-4c89-95fb-2872568e1140/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_b0fb189b-55de-4c89-95fb-2872568e1140/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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2021-12-06 22:18:52,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:18:52,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:18:52,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:18:52,052 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:18:52,052 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:18:52,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2021-12-06 22:18:52,093 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/c2a222fa9/149684636f0f4a509d1f93608340d706/FLAG8ebf19c00 [2021-12-06 22:18:52,558 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:18:52,559 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2021-12-06 22:18:52,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/c2a222fa9/149684636f0f4a509d1f93608340d706/FLAG8ebf19c00 [2021-12-06 22:18:52,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/c2a222fa9/149684636f0f4a509d1f93608340d706 [2021-12-06 22:18:52,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:18:52,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:18:52,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:18:52,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:18:52,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:18:52,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:18:52" (1/1) ... [2021-12-06 22:18:52,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca5d220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:52, skipping insertion in model container [2021-12-06 22:18:52,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:18:52" (1/1) ... [2021-12-06 22:18:52,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:18:52,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:18:52,969 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_b0fb189b-55de-4c89-95fb-2872568e1140/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i[33022,33035] [2021-12-06 22:18:53,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:18:53,150 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-06 22:18:53,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54e6dbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:53, skipping insertion in model container [2021-12-06 22:18:53,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:18:53,151 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-06 22:18:53,153 INFO L158 Benchmark]: Toolchain (without parser) took 565.97ms. Allocated memory is still 92.3MB. Free memory was 49.5MB in the beginning and 49.0MB in the end (delta: 513.4kB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-06 22:18:53,154 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 92.3MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:18:53,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.86ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 38.6kB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-06 22:18:53,156 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.12ms. Allocated memory is still 92.3MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.86ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 38.6kB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/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_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/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_b0fb189b-55de-4c89-95fb-2872568e1140/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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:18:54,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:18:54,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:18:54,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:18:54,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:18:54,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:18:54,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:18:54,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:18:54,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:18:54,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:18:54,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:18:54,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:18:54,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:18:54,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:18:54,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:18:54,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:18:54,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:18:54,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:18:54,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:18:54,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:18:54,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:18:54,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:18:54,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:18:54,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:18:54,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:18:54,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:18:54,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:18:54,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:18:54,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:18:54,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:18:54,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:18:54,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:18:54,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:18:54,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:18:54,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:18:54,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:18:54,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:18:54,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:18:54,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:18:54,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:18:54,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:18:54,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 22:18:54,638 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:18:54,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:18:54,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:18:54,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:18:54,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:18:54,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:18:54,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:18:54,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:18:54,639 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:18:54,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 22:18:54,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:18:54,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:18:54,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:18:54,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:18:54,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:18:54,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:18:54,642 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 22:18:54,642 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 22:18:54,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:18:54,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 22:18:54,642 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_b0fb189b-55de-4c89-95fb-2872568e1140/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_b0fb189b-55de-4c89-95fb-2872568e1140/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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2021-12-06 22:18:54,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:18:54,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:18:54,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:18:54,906 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:18:54,906 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:18:54,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2021-12-06 22:18:54,948 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/d50e1c99f/d73c96dc1bda45d3a4de4a6711d4a633/FLAGaae9f27f4 [2021-12-06 22:18:55,458 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:18:55,458 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2021-12-06 22:18:55,474 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/d50e1c99f/d73c96dc1bda45d3a4de4a6711d4a633/FLAGaae9f27f4 [2021-12-06 22:18:55,982 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/data/d50e1c99f/d73c96dc1bda45d3a4de4a6711d4a633 [2021-12-06 22:18:55,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:18:55,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:18:55,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:18:55,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:18:55,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:18:55,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:18:55" (1/1) ... [2021-12-06 22:18:55,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a49f186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:55, skipping insertion in model container [2021-12-06 22:18:55,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:18:55" (1/1) ... [2021-12-06 22:18:55,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:18:56,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:18:56,329 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_b0fb189b-55de-4c89-95fb-2872568e1140/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i[33022,33035] [2021-12-06 22:18:56,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:18:56,490 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-06 22:18:56,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:18:56,535 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_b0fb189b-55de-4c89-95fb-2872568e1140/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i[33022,33035] [2021-12-06 22:18:56,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:18:56,620 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:18:56,651 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_b0fb189b-55de-4c89-95fb-2872568e1140/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i[33022,33035] [2021-12-06 22:18:56,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:18:56,785 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:18:56,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56 WrapperNode [2021-12-06 22:18:56,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:18:56,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:18:56,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:18:56,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:18:56,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:56,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:56,905 INFO L137 Inliner]: procedures = 180, calls = 524, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2184 [2021-12-06 22:18:56,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:18:56,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:18:56,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:18:56,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:18:56,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:56,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:56,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:56,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:56,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:57,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:57,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:57,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:18:57,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:18:57,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:18:57,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:18:57,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (1/1) ... [2021-12-06 22:18:57,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:18:57,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:18:57,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:18:57,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:18:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-06 22:18:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2021-12-06 22:18:57,105 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2021-12-06 22:18:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-06 22:18:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 22:18:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-06 22:18:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-06 22:18:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 22:18:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:18:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-06 22:18:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 22:18:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:18:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:18:57,292 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:18:57,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:18:57,298 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-06 22:19:03,735 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:19:03,751 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:19:03,751 INFO L301 CfgBuilder]: Removed 151 assume(true) statements. [2021-12-06 22:19:03,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:19:03 BoogieIcfgContainer [2021-12-06 22:19:03,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:19:03,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:19:03,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:19:03,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:19:03,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:18:55" (1/3) ... [2021-12-06 22:19:03,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fd10cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:19:03, skipping insertion in model container [2021-12-06 22:19:03,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:18:56" (2/3) ... [2021-12-06 22:19:03,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fd10cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:19:03, skipping insertion in model container [2021-12-06 22:19:03,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:19:03" (3/3) ... [2021-12-06 22:19:03,760 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-1.i [2021-12-06 22:19:03,764 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:19:03,764 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 990 error locations. [2021-12-06 22:19:03,797 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:19:03,802 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-06 22:19:03,803 INFO L340 AbstractCegarLoop]: Starting to check reachability of 990 error locations. [2021-12-06 22:19:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 2060 states, 1058 states have (on average 2.2041587901701325) internal successors, (2332), 2046 states have internal predecessors, (2332), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-06 22:19:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 22:19:03,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:03,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 22:19:03,848 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2021-12-06 22:19:03,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:03,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682953009] [2021-12-06 22:19:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:03,862 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:03,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:03,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 22:19:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:03,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:19:03,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:04,068 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-06 22:19:04,078 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-06 22:19:04,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:04,079 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:04,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682953009] [2021-12-06 22:19:04,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682953009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:04,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:04,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:19:04,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75711306] [2021-12-06 22:19:04,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:04,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:04,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:04,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:04,116 INFO L87 Difference]: Start difference. First operand has 2060 states, 1058 states have (on average 2.2041587901701325) internal successors, (2332), 2046 states have internal predecessors, (2332), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:06,945 INFO L93 Difference]: Finished difference Result 2558 states and 2724 transitions. [2021-12-06 22:19:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 22:19:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:06,967 INFO L225 Difference]: With dead ends: 2558 [2021-12-06 22:19:06,967 INFO L226 Difference]: Without dead ends: 2556 [2021-12-06 22:19:06,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:06,970 INFO L933 BasicCegarLoop]: 1273 mSDtfsCounter, 1951 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:06,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1961 Valid, 1646 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-06 22:19:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2021-12-06 22:19:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2202. [2021-12-06 22:19:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 1224 states have (on average 2.037581699346405) internal successors, (2494), 2186 states have internal predecessors, (2494), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-06 22:19:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2526 transitions. [2021-12-06 22:19:07,058 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2526 transitions. Word has length 3 [2021-12-06 22:19:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:07,059 INFO L470 AbstractCegarLoop]: Abstraction has 2202 states and 2526 transitions. [2021-12-06 22:19:07,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2526 transitions. [2021-12-06 22:19:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 22:19:07,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:07,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 22:19:07,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:19:07,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:07,261 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2021-12-06 22:19:07,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:07,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718037104] [2021-12-06 22:19:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:07,266 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:07,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:07,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 22:19:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:07,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:19:07,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:07,400 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-06 22:19:07,408 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-06 22:19:07,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:07,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:07,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718037104] [2021-12-06 22:19:07,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718037104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:07,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:07,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:19:07,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414652802] [2021-12-06 22:19:07,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:07,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:07,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:07,412 INFO L87 Difference]: Start difference. First operand 2202 states and 2526 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:11,712 INFO L93 Difference]: Finished difference Result 2973 states and 3378 transitions. [2021-12-06 22:19:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 22:19:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:11,724 INFO L225 Difference]: With dead ends: 2973 [2021-12-06 22:19:11,724 INFO L226 Difference]: Without dead ends: 2973 [2021-12-06 22:19:11,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:11,725 INFO L933 BasicCegarLoop]: 1837 mSDtfsCounter, 844 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:11,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [848 Valid, 3017 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-12-06 22:19:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2021-12-06 22:19:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2651. [2021-12-06 22:19:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 1671 states have (on average 1.9970077797725914) internal successors, (3337), 2632 states have internal predecessors, (3337), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-06 22:19:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3375 transitions. [2021-12-06 22:19:11,774 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3375 transitions. Word has length 3 [2021-12-06 22:19:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:11,774 INFO L470 AbstractCegarLoop]: Abstraction has 2651 states and 3375 transitions. [2021-12-06 22:19:11,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3375 transitions. [2021-12-06 22:19:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-06 22:19:11,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:11,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:11,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 22:19:11,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:11,975 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2021-12-06 22:19:11,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581007656] [2021-12-06 22:19:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:11,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:11,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:11,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 22:19:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:12,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 22:19:12,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:12,103 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-06 22:19:12,108 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-06 22:19:12,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:19:12,154 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-06 22:19:12,164 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:19:12,165 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 16 treesize of output 16 [2021-12-06 22:19:12,189 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-06 22:19:12,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:12,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581007656] [2021-12-06 22:19:12,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581007656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:12,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:12,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:12,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887151821] [2021-12-06 22:19:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:12,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:12,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:12,190 INFO L87 Difference]: Start difference. First operand 2651 states and 3375 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-06 22:19:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:19,645 INFO L93 Difference]: Finished difference Result 4906 states and 5782 transitions. [2021-12-06 22:19:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-06 22:19:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:19,663 INFO L225 Difference]: With dead ends: 4906 [2021-12-06 22:19:19,663 INFO L226 Difference]: Without dead ends: 4906 [2021-12-06 22:19:19,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-06 22:19:19,664 INFO L933 BasicCegarLoop]: 776 mSDtfsCounter, 4307 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:19,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4317 Valid, 2067 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2021-12-06 22:19:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2021-12-06 22:19:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 3370. [2021-12-06 22:19:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 2390 states have (on average 2.0351464435146442) internal successors, (4864), 3345 states have internal predecessors, (4864), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4914 transitions. [2021-12-06 22:19:19,735 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4914 transitions. Word has length 7 [2021-12-06 22:19:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:19,735 INFO L470 AbstractCegarLoop]: Abstraction has 3370 states and 4914 transitions. [2021-12-06 22:19:19,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-06 22:19:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4914 transitions. [2021-12-06 22:19:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 22:19:19,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:19,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:19,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 22:19:19,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:19,937 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2021-12-06 22:19:19,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:19,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062228292] [2021-12-06 22:19:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:19,943 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:19,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:19,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 22:19:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:20,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:19:20,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:20,132 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-06 22:19:20,144 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-06 22:19:20,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:20,144 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062228292] [2021-12-06 22:19:20,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062228292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:20,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:20,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:19:20,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988625595] [2021-12-06 22:19:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:20,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:20,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:20,146 INFO L87 Difference]: Start difference. First operand 3370 states and 4914 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-06 22:19:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:23,003 INFO L93 Difference]: Finished difference Result 4574 states and 6431 transitions. [2021-12-06 22:19:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:23,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-06 22:19:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:23,019 INFO L225 Difference]: With dead ends: 4574 [2021-12-06 22:19:23,020 INFO L226 Difference]: Without dead ends: 4574 [2021-12-06 22:19:23,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-06 22:19:23,020 INFO L933 BasicCegarLoop]: 1967 mSDtfsCounter, 1998 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:23,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2008 Valid, 2622 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-06 22:19:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2021-12-06 22:19:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 3279. [2021-12-06 22:19:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 2390 states have (on average 1.9460251046025105) internal successors, (4651), 3254 states have internal predecessors, (4651), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4701 transitions. [2021-12-06 22:19:23,077 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4701 transitions. Word has length 8 [2021-12-06 22:19:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:23,078 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4701 transitions. [2021-12-06 22:19:23,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-06 22:19:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4701 transitions. [2021-12-06 22:19:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 22:19:23,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:23,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:23,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 22:19:23,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:23,279 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2021-12-06 22:19:23,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:23,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473619107] [2021-12-06 22:19:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:23,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:23,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:23,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:23,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 22:19:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:23,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:19:23,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:23,380 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-06 22:19:23,397 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-06 22:19:23,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:23,398 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:23,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473619107] [2021-12-06 22:19:23,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473619107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:23,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:23,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:19:23,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701743808] [2021-12-06 22:19:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:23,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:23,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:23,399 INFO L87 Difference]: Start difference. First operand 3279 states and 4701 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-06 22:19:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:28,102 INFO L93 Difference]: Finished difference Result 4996 states and 7060 transitions. [2021-12-06 22:19:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-06 22:19:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:28,123 INFO L225 Difference]: With dead ends: 4996 [2021-12-06 22:19:28,123 INFO L226 Difference]: Without dead ends: 4996 [2021-12-06 22:19:28,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-06 22:19:28,124 INFO L933 BasicCegarLoop]: 2347 mSDtfsCounter, 1371 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:28,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1375 Valid, 3335 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-12-06 22:19:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2021-12-06 22:19:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 3601. [2021-12-06 22:19:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3601 states, 2722 states have (on average 1.9335047759000734) internal successors, (5263), 3576 states have internal predecessors, (5263), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5313 transitions. [2021-12-06 22:19:28,180 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5313 transitions. Word has length 8 [2021-12-06 22:19:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:28,180 INFO L470 AbstractCegarLoop]: Abstraction has 3601 states and 5313 transitions. [2021-12-06 22:19:28,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-06 22:19:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5313 transitions. [2021-12-06 22:19:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 22:19:28,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:28,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:28,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 22:19:28,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:28,382 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2021-12-06 22:19:28,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:28,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511970024] [2021-12-06 22:19:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:28,386 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:28,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:28,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:28,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 22:19:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:28,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 22:19:28,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:28,549 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-06 22:19:28,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:28,549 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511970024] [2021-12-06 22:19:28,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511970024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:28,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:28,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:28,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31984341] [2021-12-06 22:19:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:28,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:28,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:28,551 INFO L87 Difference]: Start difference. First operand 3601 states and 5313 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-06 22:19:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:28,580 INFO L93 Difference]: Finished difference Result 3541 states and 5227 transitions. [2021-12-06 22:19:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:28,580 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-06 22:19:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:28,594 INFO L225 Difference]: With dead ends: 3541 [2021-12-06 22:19:28,594 INFO L226 Difference]: Without dead ends: 3541 [2021-12-06 22:19:28,594 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-06 22:19:28,595 INFO L933 BasicCegarLoop]: 2011 mSDtfsCounter, 801 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3227 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-06 22:19:28,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 3227 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:19:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2021-12-06 22:19:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3541. [2021-12-06 22:19:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2686 states have (on average 1.9274013402829486) internal successors, (5177), 3516 states have internal predecessors, (5177), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5227 transitions. [2021-12-06 22:19:28,651 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5227 transitions. Word has length 11 [2021-12-06 22:19:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:28,651 INFO L470 AbstractCegarLoop]: Abstraction has 3541 states and 5227 transitions. [2021-12-06 22:19:28,651 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-06 22:19:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5227 transitions. [2021-12-06 22:19:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 22:19:28,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:28,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:28,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 22:19:28,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:28,853 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2021-12-06 22:19:28,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:28,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839917292] [2021-12-06 22:19:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:28,854 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:28,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:28,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 22:19:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:28,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:19:28,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:29,012 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-06 22:19:29,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:29,013 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:29,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839917292] [2021-12-06 22:19:29,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839917292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:29,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:29,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:29,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046845606] [2021-12-06 22:19:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:29,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:29,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:29,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:29,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:29,014 INFO L87 Difference]: Start difference. First operand 3541 states and 5227 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-06 22:19:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:29,076 INFO L93 Difference]: Finished difference Result 3513 states and 5171 transitions. [2021-12-06 22:19:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:29,077 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-06 22:19:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:29,091 INFO L225 Difference]: With dead ends: 3513 [2021-12-06 22:19:29,092 INFO L226 Difference]: Without dead ends: 3513 [2021-12-06 22:19:29,092 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-06 22:19:29,092 INFO L933 BasicCegarLoop]: 1966 mSDtfsCounter, 772 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5141 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-06 22:19:29,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 5141 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:19:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2021-12-06 22:19:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2021-12-06 22:19:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2670 states have (on average 1.9172284644194757) internal successors, (5119), 3486 states have internal predecessors, (5119), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5169 transitions. [2021-12-06 22:19:29,139 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5169 transitions. Word has length 13 [2021-12-06 22:19:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:29,139 INFO L470 AbstractCegarLoop]: Abstraction has 3511 states and 5169 transitions. [2021-12-06 22:19:29,140 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-06 22:19:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5169 transitions. [2021-12-06 22:19:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 22:19:29,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:29,140 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] [2021-12-06 22:19:29,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 22:19:29,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:29,341 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2021-12-06 22:19:29,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:29,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525279772] [2021-12-06 22:19:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:29,343 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:29,344 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:29,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 22:19:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:29,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 22:19:29,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:29,517 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-06 22:19:29,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:29,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525279772] [2021-12-06 22:19:29,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525279772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:29,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:29,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:29,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006482830] [2021-12-06 22:19:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:29,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:29,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:29,519 INFO L87 Difference]: Start difference. First operand 3511 states and 5169 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:29,567 INFO L93 Difference]: Finished difference Result 4760 states and 6526 transitions. [2021-12-06 22:19:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 22:19:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:29,581 INFO L225 Difference]: With dead ends: 4760 [2021-12-06 22:19:29,581 INFO L226 Difference]: Without dead ends: 4760 [2021-12-06 22:19:29,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-06 22:19:29,582 INFO L933 BasicCegarLoop]: 3299 mSDtfsCounter, 1892 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1902 SdHoareTripleChecker+Valid, 4705 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-06 22:19:29,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1902 Valid, 4705 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:19:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2021-12-06 22:19:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 3451. [2021-12-06 22:19:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2634 states have (on average 1.910782080485953) internal successors, (5033), 3426 states have internal predecessors, (5033), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5083 transitions. [2021-12-06 22:19:29,634 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5083 transitions. Word has length 20 [2021-12-06 22:19:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:29,634 INFO L470 AbstractCegarLoop]: Abstraction has 3451 states and 5083 transitions. [2021-12-06 22:19:29,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5083 transitions. [2021-12-06 22:19:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 22:19:29,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:29,635 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] [2021-12-06 22:19:29,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-06 22:19:29,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:29,836 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2021-12-06 22:19:29,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:29,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962799478] [2021-12-06 22:19:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:29,838 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:29,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:29,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:29,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 22:19:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:30,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 22:19:30,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:30,078 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-06 22:19:30,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:30,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:30,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962799478] [2021-12-06 22:19:30,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962799478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:30,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:30,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:30,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204569017] [2021-12-06 22:19:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:30,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:19:30,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:19:30,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:19:30,079 INFO L87 Difference]: Start difference. First operand 3451 states and 5083 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:30,111 INFO L93 Difference]: Finished difference Result 4593 states and 6235 transitions. [2021-12-06 22:19:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:19:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 22:19:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:30,118 INFO L225 Difference]: With dead ends: 4593 [2021-12-06 22:19:30,118 INFO L226 Difference]: Without dead ends: 4593 [2021-12-06 22:19:30,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-06 22:19:30,119 INFO L933 BasicCegarLoop]: 3208 mSDtfsCounter, 1849 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 4566 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-06 22:19:30,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1859 Valid, 4566 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:19:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-12-06 22:19:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3319. [2021-12-06 22:19:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3319 states, 2526 states have (on average 1.8903404592240696) internal successors, (4775), 3294 states have internal predecessors, (4775), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4825 transitions. [2021-12-06 22:19:30,163 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4825 transitions. Word has length 20 [2021-12-06 22:19:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:30,163 INFO L470 AbstractCegarLoop]: Abstraction has 3319 states and 4825 transitions. [2021-12-06 22:19:30,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4825 transitions. [2021-12-06 22:19:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 22:19:30,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:30,164 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] [2021-12-06 22:19:30,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 22:19:30,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:30,366 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2021-12-06 22:19:30,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:30,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039400824] [2021-12-06 22:19:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:30,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:30,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:30,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 22:19:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:30,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:19:30,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:30,532 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-06 22:19:30,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:30,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:30,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039400824] [2021-12-06 22:19:30,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039400824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:30,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:30,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:30,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634082471] [2021-12-06 22:19:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:30,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:30,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:30,533 INFO L87 Difference]: Start difference. First operand 3319 states and 4825 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-06 22:19:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:30,608 INFO L93 Difference]: Finished difference Result 4558 states and 6169 transitions. [2021-12-06 22:19:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-06 22:19:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:30,615 INFO L225 Difference]: With dead ends: 4558 [2021-12-06 22:19:30,615 INFO L226 Difference]: Without dead ends: 4558 [2021-12-06 22:19:30,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-06 22:19:30,616 INFO L933 BasicCegarLoop]: 3168 mSDtfsCounter, 1820 mSDsluCounter, 4524 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 7692 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-06 22:19:30,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1830 Valid, 7692 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:19:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2021-12-06 22:19:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 3289. [2021-12-06 22:19:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 2510 states have (on average 1.8792828685258964) internal successors, (4717), 3264 states have internal predecessors, (4717), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4767 transitions. [2021-12-06 22:19:30,663 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4767 transitions. Word has length 22 [2021-12-06 22:19:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:30,663 INFO L470 AbstractCegarLoop]: Abstraction has 3289 states and 4767 transitions. [2021-12-06 22:19:30,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-06 22:19:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4767 transitions. [2021-12-06 22:19:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 22:19:30,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:30,664 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] [2021-12-06 22:19:30,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-06 22:19:30,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:30,866 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2021-12-06 22:19:30,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:30,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710921887] [2021-12-06 22:19:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:30,868 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:30,870 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:30,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 22:19:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:31,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:19:31,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:31,063 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-06 22:19:31,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:31,063 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:31,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710921887] [2021-12-06 22:19:31,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710921887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:31,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:31,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:31,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070157729] [2021-12-06 22:19:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:31,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:31,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:31,065 INFO L87 Difference]: Start difference. First operand 3289 states and 4767 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-06 22:19:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:31,132 INFO L93 Difference]: Finished difference Result 4485 states and 5980 transitions. [2021-12-06 22:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:31,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-06 22:19:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:31,147 INFO L225 Difference]: With dead ends: 4485 [2021-12-06 22:19:31,147 INFO L226 Difference]: Without dead ends: 4485 [2021-12-06 22:19:31,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-06 22:19:31,148 INFO L933 BasicCegarLoop]: 3093 mSDtfsCounter, 1785 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 7502 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-06 22:19:31,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1795 Valid, 7502 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:19:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2021-12-06 22:19:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 3227. [2021-12-06 22:19:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 2462 states have (on average 1.8452477660438669) internal successors, (4543), 3202 states have internal predecessors, (4543), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4593 transitions. [2021-12-06 22:19:31,185 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4593 transitions. Word has length 22 [2021-12-06 22:19:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:31,185 INFO L470 AbstractCegarLoop]: Abstraction has 3227 states and 4593 transitions. [2021-12-06 22:19:31,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-06 22:19:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4593 transitions. [2021-12-06 22:19:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 22:19:31,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:31,187 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-06 22:19:31,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-06 22:19:31,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:31,387 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2021-12-06 22:19:31,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:31,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369207503] [2021-12-06 22:19:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:31,388 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:31,389 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:31,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 22:19:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:31,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:19:31,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:31,491 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-06 22:19:31,539 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-06 22:19:31,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:31,539 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:31,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369207503] [2021-12-06 22:19:31,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369207503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:31,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:31,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:31,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33493486] [2021-12-06 22:19:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:31,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:31,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:31,540 INFO L87 Difference]: Start difference. First operand 3227 states and 4593 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-06 22:19:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:34,525 INFO L93 Difference]: Finished difference Result 3502 states and 4766 transitions. [2021-12-06 22:19:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:34,526 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-06 22:19:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:34,530 INFO L225 Difference]: With dead ends: 3502 [2021-12-06 22:19:34,530 INFO L226 Difference]: Without dead ends: 3502 [2021-12-06 22:19:34,530 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-06 22:19:34,531 INFO L933 BasicCegarLoop]: 1123 mSDtfsCounter, 2363 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:34,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2369 Valid, 2017 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-06 22:19:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2021-12-06 22:19:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3223. [2021-12-06 22:19:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 3198 states have internal predecessors, (4535), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4585 transitions. [2021-12-06 22:19:34,560 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4585 transitions. Word has length 27 [2021-12-06 22:19:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:34,561 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 4585 transitions. [2021-12-06 22:19:34,561 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-06 22:19:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4585 transitions. [2021-12-06 22:19:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 22:19:34,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:34,561 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-06 22:19:34,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-06 22:19:34,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:34,762 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2021-12-06 22:19:34,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:34,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103022442] [2021-12-06 22:19:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:34,763 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:34,764 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:34,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-06 22:19:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:34,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:19:34,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:34,887 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-06 22:19:34,984 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-06 22:19:34,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:34,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:34,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103022442] [2021-12-06 22:19:34,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103022442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:34,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:34,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:34,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42350651] [2021-12-06 22:19:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:34,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:34,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:34,985 INFO L87 Difference]: Start difference. First operand 3223 states and 4585 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-06 22:19:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:39,867 INFO L93 Difference]: Finished difference Result 3925 states and 5359 transitions. [2021-12-06 22:19:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:19:39,868 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-06 22:19:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:39,873 INFO L225 Difference]: With dead ends: 3925 [2021-12-06 22:19:39,874 INFO L226 Difference]: Without dead ends: 3925 [2021-12-06 22:19:39,874 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-06 22:19:39,874 INFO L933 BasicCegarLoop]: 1540 mSDtfsCounter, 1487 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:39,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1487 Valid, 3475 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2021-12-06 22:19:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2021-12-06 22:19:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3259. [2021-12-06 22:19:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2498 states have (on average 1.831865492393915) internal successors, (4576), 3234 states have internal predecessors, (4576), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 4626 transitions. [2021-12-06 22:19:39,906 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 4626 transitions. Word has length 27 [2021-12-06 22:19:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:39,906 INFO L470 AbstractCegarLoop]: Abstraction has 3259 states and 4626 transitions. [2021-12-06 22:19:39,906 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-06 22:19:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 4626 transitions. [2021-12-06 22:19:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 22:19:39,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:39,907 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] [2021-12-06 22:19:39,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-06 22:19:40,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:40,108 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2021-12-06 22:19:40,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:40,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17717396] [2021-12-06 22:19:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:40,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:40,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:40,110 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:40,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 22:19:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:40,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:19:40,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:40,242 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-06 22:19:40,295 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-06 22:19:40,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:40,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:40,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17717396] [2021-12-06 22:19:40,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17717396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:40,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:40,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:40,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313114780] [2021-12-06 22:19:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:40,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:40,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:40,297 INFO L87 Difference]: Start difference. First operand 3259 states and 4626 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:19:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:44,838 INFO L93 Difference]: Finished difference Result 6304 states and 8790 transitions. [2021-12-06 22:19:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-06 22:19:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:44,848 INFO L225 Difference]: With dead ends: 6304 [2021-12-06 22:19:44,848 INFO L226 Difference]: Without dead ends: 6304 [2021-12-06 22:19:44,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-06 22:19:44,849 INFO L933 BasicCegarLoop]: 2393 mSDtfsCounter, 3502 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3509 SdHoareTripleChecker+Valid, 4226 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:44,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3509 Valid, 4226 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-12-06 22:19:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2021-12-06 22:19:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 3255. [2021-12-06 22:19:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 2498 states have (on average 1.8286629303442754) internal successors, (4568), 3230 states have internal predecessors, (4568), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4618 transitions. [2021-12-06 22:19:44,896 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4618 transitions. Word has length 36 [2021-12-06 22:19:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:44,896 INFO L470 AbstractCegarLoop]: Abstraction has 3255 states and 4618 transitions. [2021-12-06 22:19:44,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:19:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4618 transitions. [2021-12-06 22:19:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 22:19:44,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:44,897 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] [2021-12-06 22:19:44,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-06 22:19:45,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:45,097 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2021-12-06 22:19:45,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559824237] [2021-12-06 22:19:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:45,098 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:45,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:45,099 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:45,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-06 22:19:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:45,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:19:45,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:45,248 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-06 22:19:45,398 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-06 22:19:45,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:45,398 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:45,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559824237] [2021-12-06 22:19:45,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559824237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:45,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:45,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:45,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481564094] [2021-12-06 22:19:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:45,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:45,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:45,400 INFO L87 Difference]: Start difference. First operand 3255 states and 4618 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:19:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:51,864 INFO L93 Difference]: Finished difference Result 5973 states and 8166 transitions. [2021-12-06 22:19:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:19:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-06 22:19:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:51,868 INFO L225 Difference]: With dead ends: 5973 [2021-12-06 22:19:51,868 INFO L226 Difference]: Without dead ends: 5973 [2021-12-06 22:19:51,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-06 22:19:51,869 INFO L933 BasicCegarLoop]: 2332 mSDtfsCounter, 2860 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:51,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2864 Valid, 4625 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-12-06 22:19:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2021-12-06 22:19:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3251. [2021-12-06 22:19:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2498 states have (on average 1.8254603682946358) internal successors, (4560), 3226 states have internal predecessors, (4560), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4610 transitions. [2021-12-06 22:19:51,904 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4610 transitions. Word has length 36 [2021-12-06 22:19:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:51,904 INFO L470 AbstractCegarLoop]: Abstraction has 3251 states and 4610 transitions. [2021-12-06 22:19:51,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:19:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4610 transitions. [2021-12-06 22:19:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 22:19:51,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:51,905 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] [2021-12-06 22:19:51,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-06 22:19:52,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:52,105 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2021-12-06 22:19:52,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:52,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210330490] [2021-12-06 22:19:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:52,106 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:52,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:52,107 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:52,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 22:19:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:52,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:19:52,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:52,246 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-06 22:19:52,302 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-06 22:19:52,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:52,302 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:52,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210330490] [2021-12-06 22:19:52,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210330490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:52,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:52,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:52,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560616743] [2021-12-06 22:19:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:52,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:52,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:52,303 INFO L87 Difference]: Start difference. First operand 3251 states and 4610 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:19:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:19:57,122 INFO L93 Difference]: Finished difference Result 6748 states and 9302 transitions. [2021-12-06 22:19:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:19:57,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-06 22:19:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:19:57,129 INFO L225 Difference]: With dead ends: 6748 [2021-12-06 22:19:57,129 INFO L226 Difference]: Without dead ends: 6748 [2021-12-06 22:19:57,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-06 22:19:57,129 INFO L933 BasicCegarLoop]: 1965 mSDtfsCounter, 4494 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-12-06 22:19:57,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4504 Valid, 3990 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-12-06 22:19:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states. [2021-12-06 22:19:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 3248. [2021-12-06 22:19:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2498 states have (on average 1.8166533226581265) internal successors, (4538), 3223 states have internal predecessors, (4538), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:19:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4588 transitions. [2021-12-06 22:19:57,171 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4588 transitions. Word has length 36 [2021-12-06 22:19:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:19:57,171 INFO L470 AbstractCegarLoop]: Abstraction has 3248 states and 4588 transitions. [2021-12-06 22:19:57,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:19:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4588 transitions. [2021-12-06 22:19:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 22:19:57,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:19:57,172 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] [2021-12-06 22:19:57,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-06 22:19:57,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:19:57,372 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:19:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2021-12-06 22:19:57,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:19:57,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49083142] [2021-12-06 22:19:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:57,373 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:19:57,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:19:57,374 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:19:57,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 22:19:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:57,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:19:57,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:19:57,515 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-06 22:19:57,618 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-06 22:19:57,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:19:57,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:19:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49083142] [2021-12-06 22:19:57,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49083142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:57,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:57,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:19:57,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842937984] [2021-12-06 22:19:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:57,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:57,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:19:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:57,619 INFO L87 Difference]: Start difference. First operand 3248 states and 4588 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:20:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:03,196 INFO L93 Difference]: Finished difference Result 4807 states and 6551 transitions. [2021-12-06 22:20:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-06 22:20:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:03,200 INFO L225 Difference]: With dead ends: 4807 [2021-12-06 22:20:03,200 INFO L226 Difference]: Without dead ends: 4807 [2021-12-06 22:20:03,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-06 22:20:03,201 INFO L933 BasicCegarLoop]: 2238 mSDtfsCounter, 2208 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:03,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2208 Valid, 4103 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2021-12-06 22:20:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2021-12-06 22:20:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 3248. [2021-12-06 22:20:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2498 states have (on average 1.8134507606084869) internal successors, (4530), 3223 states have internal predecessors, (4530), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:20:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4580 transitions. [2021-12-06 22:20:03,233 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4580 transitions. Word has length 36 [2021-12-06 22:20:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:03,233 INFO L470 AbstractCegarLoop]: Abstraction has 3248 states and 4580 transitions. [2021-12-06 22:20:03,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-06 22:20:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4580 transitions. [2021-12-06 22:20:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 22:20:03,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:03,233 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] [2021-12-06 22:20:03,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-06 22:20:03,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:03,434 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2021-12-06 22:20:03,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:03,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958397045] [2021-12-06 22:20:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:03,436 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:03,437 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:03,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 22:20:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:03,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:20:03,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:03,651 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-06 22:20:03,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:03,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:03,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958397045] [2021-12-06 22:20:03,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958397045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:03,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:03,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:03,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707029729] [2021-12-06 22:20:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:03,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:03,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:03,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:03,653 INFO L87 Difference]: Start difference. First operand 3248 states and 4580 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-06 22:20:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:03,690 INFO L93 Difference]: Finished difference Result 3236 states and 4556 transitions. [2021-12-06 22:20:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-12-06 22:20:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:03,692 INFO L225 Difference]: With dead ends: 3236 [2021-12-06 22:20:03,692 INFO L226 Difference]: Without dead ends: 3236 [2021-12-06 22:20:03,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-06 22:20:03,693 INFO L933 BasicCegarLoop]: 1797 mSDtfsCounter, 756 mSDsluCounter, 2825 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 4622 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-06 22:20:03,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 4622 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:20:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2021-12-06 22:20:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3236. [2021-12-06 22:20:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2486 states have (on average 1.8125502815768302) internal successors, (4506), 3211 states have internal predecessors, (4506), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 22:20:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4556 transitions. [2021-12-06 22:20:03,719 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4556 transitions. Word has length 40 [2021-12-06 22:20:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:03,720 INFO L470 AbstractCegarLoop]: Abstraction has 3236 states and 4556 transitions. [2021-12-06 22:20:03,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-06 22:20:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4556 transitions. [2021-12-06 22:20:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 22:20:03,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:03,720 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] [2021-12-06 22:20:03,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-06 22:20:03,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:03,922 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2021-12-06 22:20:03,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:03,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322675349] [2021-12-06 22:20:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:03,925 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:03,927 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:03,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 22:20:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:04,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:20:04,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:04,242 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-06 22:20:04,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:04,242 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:04,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322675349] [2021-12-06 22:20:04,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322675349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:04,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:04,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:20:04,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833974547] [2021-12-06 22:20:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:04,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:20:04,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:04,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:20:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:20:04,244 INFO L87 Difference]: Start difference. First operand 3236 states and 4556 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:04,366 INFO L93 Difference]: Finished difference Result 4684 states and 6375 transitions. [2021-12-06 22:20:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:20:04,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 22:20:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:04,370 INFO L225 Difference]: With dead ends: 4684 [2021-12-06 22:20:04,370 INFO L226 Difference]: Without dead ends: 4684 [2021-12-06 22:20:04,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-06 22:20:04,371 INFO L933 BasicCegarLoop]: 1820 mSDtfsCounter, 1180 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:04,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 3502 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:20:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2021-12-06 22:20:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4020. [2021-12-06 22:20:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 3266 states have (on average 1.7988364972443356) internal successors, (5875), 3988 states have internal predecessors, (5875), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 22:20:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5939 transitions. [2021-12-06 22:20:04,407 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5939 transitions. Word has length 48 [2021-12-06 22:20:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:04,407 INFO L470 AbstractCegarLoop]: Abstraction has 4020 states and 5939 transitions. [2021-12-06 22:20:04,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5939 transitions. [2021-12-06 22:20:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 22:20:04,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:04,408 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] [2021-12-06 22:20:04,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-06 22:20:04,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:04,609 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2021-12-06 22:20:04,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:04,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328727714] [2021-12-06 22:20:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:04,613 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:04,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:04,615 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:04,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-06 22:20:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:04,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:20:04,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:04,843 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-06 22:20:04,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:04,843 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:04,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328727714] [2021-12-06 22:20:04,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328727714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:04,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:04,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:04,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344094465] [2021-12-06 22:20:04,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:04,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:04,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:04,845 INFO L87 Difference]: Start difference. First operand 4020 states and 5939 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-06 22:20:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:04,892 INFO L93 Difference]: Finished difference Result 4959 states and 6922 transitions. [2021-12-06 22:20:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-12-06 22:20:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:04,897 INFO L225 Difference]: With dead ends: 4959 [2021-12-06 22:20:04,897 INFO L226 Difference]: Without dead ends: 4959 [2021-12-06 22:20:04,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-06 22:20:04,898 INFO L933 BasicCegarLoop]: 2867 mSDtfsCounter, 1755 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 6826 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-06 22:20:04,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1765 Valid, 6826 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:20:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2021-12-06 22:20:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 3978. [2021-12-06 22:20:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3224 states have (on average 1.8005583126550868) internal successors, (5805), 3946 states have internal predecessors, (5805), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 22:20:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5869 transitions. [2021-12-06 22:20:04,935 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5869 transitions. Word has length 51 [2021-12-06 22:20:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:04,935 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 5869 transitions. [2021-12-06 22:20:04,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-06 22:20:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5869 transitions. [2021-12-06 22:20:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-06 22:20:04,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:04,936 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] [2021-12-06 22:20:04,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-06 22:20:05,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:05,137 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2021-12-06 22:20:05,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:05,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782691711] [2021-12-06 22:20:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:05,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:05,143 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:05,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 22:20:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:05,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:20:05,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:05,442 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-06 22:20:05,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:05,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782691711] [2021-12-06 22:20:05,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782691711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:05,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:05,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:05,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744965352] [2021-12-06 22:20:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:05,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:05,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:05,444 INFO L87 Difference]: Start difference. First operand 3978 states and 5869 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-06 22:20:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:05,490 INFO L93 Difference]: Finished difference Result 4695 states and 6408 transitions. [2021-12-06 22:20:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-12-06 22:20:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:05,494 INFO L225 Difference]: With dead ends: 4695 [2021-12-06 22:20:05,494 INFO L226 Difference]: Without dead ends: 4695 [2021-12-06 22:20:05,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-06 22:20:05,495 INFO L933 BasicCegarLoop]: 2907 mSDtfsCounter, 1746 mSDsluCounter, 4048 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 6955 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-06 22:20:05,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 6955 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:20:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2021-12-06 22:20:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 3960. [2021-12-06 22:20:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3206 states have (on average 1.8013100436681222) internal successors, (5775), 3928 states have internal predecessors, (5775), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 22:20:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5839 transitions. [2021-12-06 22:20:05,527 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5839 transitions. Word has length 54 [2021-12-06 22:20:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:05,527 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 5839 transitions. [2021-12-06 22:20:05,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-06 22:20:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5839 transitions. [2021-12-06 22:20:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 22:20:05,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:05,528 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] [2021-12-06 22:20:05,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-06 22:20:05,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:05,729 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash -495130849, now seen corresponding path program 1 times [2021-12-06 22:20:05,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:05,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778948029] [2021-12-06 22:20:05,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:05,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:05,735 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:05,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-06 22:20:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:05,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 22:20:05,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:05,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:20:05,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:20:06,022 INFO L354 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2021-12-06 22:20:06,022 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 3 case distinctions, treesize of input 29 treesize of output 36 [2021-12-06 22:20:06,049 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-06 22:20:06,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2021-12-06 22:20:06,101 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-06 22:20:06,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:06,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:06,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778948029] [2021-12-06 22:20:06,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778948029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:06,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:06,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:06,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511504062] [2021-12-06 22:20:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:06,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:06,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:06,103 INFO L87 Difference]: Start difference. First operand 3960 states and 5839 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:07,419 INFO L93 Difference]: Finished difference Result 3926 states and 5804 transitions. [2021-12-06 22:20:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:07,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-06 22:20:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:07,423 INFO L225 Difference]: With dead ends: 3926 [2021-12-06 22:20:07,423 INFO L226 Difference]: Without dead ends: 3926 [2021-12-06 22:20:07,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-06 22:20:07,424 INFO L933 BasicCegarLoop]: 1695 mSDtfsCounter, 759 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4259 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:07,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 4259 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 112 Unchecked, 1.3s Time] [2021-12-06 22:20:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2021-12-06 22:20:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3926. [2021-12-06 22:20:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3172 states have (on average 1.8095838587641866) internal successors, (5740), 3894 states have internal predecessors, (5740), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 22:20:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5804 transitions. [2021-12-06 22:20:07,459 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5804 transitions. Word has length 57 [2021-12-06 22:20:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:07,460 INFO L470 AbstractCegarLoop]: Abstraction has 3926 states and 5804 transitions. [2021-12-06 22:20:07,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5804 transitions. [2021-12-06 22:20:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:20:07,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:07,460 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] [2021-12-06 22:20:07,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-06 22:20:07,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:07,661 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2021-12-06 22:20:07,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:07,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888090573] [2021-12-06 22:20:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:07,662 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:07,662 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:07,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-06 22:20:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:07,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:20:07,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:07,994 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-06 22:20:07,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:07,995 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:07,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888090573] [2021-12-06 22:20:07,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888090573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:07,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:07,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:20:07,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781835526] [2021-12-06 22:20:07,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:07,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:20:07,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:07,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:20:07,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:20:07,996 INFO L87 Difference]: Start difference. First operand 3926 states and 5804 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-06 22:20:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:08,142 INFO L93 Difference]: Finished difference Result 5186 states and 7398 transitions. [2021-12-06 22:20:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:20:08,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-12-06 22:20:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:08,147 INFO L225 Difference]: With dead ends: 5186 [2021-12-06 22:20:08,147 INFO L226 Difference]: Without dead ends: 5186 [2021-12-06 22:20:08,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-06 22:20:08,148 INFO L933 BasicCegarLoop]: 1948 mSDtfsCounter, 870 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:08,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 3621 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:20:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2021-12-06 22:20:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 4843. [2021-12-06 22:20:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4083 states have (on average 1.7891256429096252) internal successors, (7305), 4802 states have internal predecessors, (7305), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 22:20:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 7387 transitions. [2021-12-06 22:20:08,187 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 7387 transitions. Word has length 59 [2021-12-06 22:20:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:08,188 INFO L470 AbstractCegarLoop]: Abstraction has 4843 states and 7387 transitions. [2021-12-06 22:20:08,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-06 22:20:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 7387 transitions. [2021-12-06 22:20:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 22:20:08,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:08,188 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] [2021-12-06 22:20:08,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-06 22:20:08,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:08,390 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2021-12-06 22:20:08,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716782689] [2021-12-06 22:20:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:08,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:08,395 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:08,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-06 22:20:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:08,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 22:20:08,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:08,685 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-06 22:20:08,692 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-06 22:20:09,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:20:09,048 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-06 22:20:09,057 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:20:09,057 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 14 treesize of output 14 [2021-12-06 22:20:09,065 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-06 22:20:09,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:09,065 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:09,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716782689] [2021-12-06 22:20:09,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716782689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:09,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:09,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:20:09,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288823511] [2021-12-06 22:20:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:09,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:09,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:09,067 INFO L87 Difference]: Start difference. First operand 4843 states and 7387 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-06 22:20:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:13,057 INFO L93 Difference]: Finished difference Result 6874 states and 10400 transitions. [2021-12-06 22:20:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-12-06 22:20:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:13,063 INFO L225 Difference]: With dead ends: 6874 [2021-12-06 22:20:13,064 INFO L226 Difference]: Without dead ends: 6874 [2021-12-06 22:20:13,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-06 22:20:13,064 INFO L933 BasicCegarLoop]: 642 mSDtfsCounter, 4069 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4083 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:13,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4083 Valid, 1047 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-12-06 22:20:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6874 states. [2021-12-06 22:20:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6874 to 4603. [2021-12-06 22:20:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 3927 states have (on average 1.7122485357779476) internal successors, (6724), 4562 states have internal predecessors, (6724), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 22:20:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 6806 transitions. [2021-12-06 22:20:13,107 INFO L78 Accepts]: Start accepts. Automaton has 4603 states and 6806 transitions. Word has length 62 [2021-12-06 22:20:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:13,107 INFO L470 AbstractCegarLoop]: Abstraction has 4603 states and 6806 transitions. [2021-12-06 22:20:13,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-06 22:20:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4603 states and 6806 transitions. [2021-12-06 22:20:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 22:20:13,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:13,108 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-06 22:20:13,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-06 22:20:13,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:13,309 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2021-12-06 22:20:13,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:13,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534385410] [2021-12-06 22:20:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:13,310 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:13,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:13,312 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:13,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-06 22:20:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:13,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 22:20:13,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:13,624 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-06 22:20:13,633 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-06 22:20:13,659 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-06 22:20:13,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-06 22:20:13,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:13,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:13,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534385410] [2021-12-06 22:20:13,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534385410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:13,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:13,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:13,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571709892] [2021-12-06 22:20:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:13,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:20:13,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:20:13,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:20:13,667 INFO L87 Difference]: Start difference. First operand 4603 states and 6806 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:17,216 INFO L93 Difference]: Finished difference Result 4602 states and 6803 transitions. [2021-12-06 22:20:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:20:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-12-06 22:20:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:17,220 INFO L225 Difference]: With dead ends: 4602 [2021-12-06 22:20:17,220 INFO L226 Difference]: Without dead ends: 4602 [2021-12-06 22:20:17,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-06 22:20:17,220 INFO L933 BasicCegarLoop]: 1716 mSDtfsCounter, 4 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4589 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:17,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 4589 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-12-06 22:20:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2021-12-06 22:20:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2021-12-06 22:20:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 3927 states have (on average 1.711484593837535) internal successors, (6721), 4561 states have internal predecessors, (6721), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 22:20:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6803 transitions. [2021-12-06 22:20:17,262 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6803 transitions. Word has length 67 [2021-12-06 22:20:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:17,262 INFO L470 AbstractCegarLoop]: Abstraction has 4602 states and 6803 transitions. [2021-12-06 22:20:17,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6803 transitions. [2021-12-06 22:20:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 22:20:17,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:17,263 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-06 22:20:17,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-06 22:20:17,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:17,464 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2021-12-06 22:20:17,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620081131] [2021-12-06 22:20:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:17,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:17,471 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:17,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-06 22:20:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:17,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 22:20:17,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:17,917 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-06 22:20:17,933 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-06 22:20:17,939 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-06 22:20:17,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 21 treesize of output 9 [2021-12-06 22:20:17,978 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-06 22:20:17,990 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-06 22:20:17,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:17,990 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:17,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620081131] [2021-12-06 22:20:17,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620081131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:17,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:17,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:17,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756402479] [2021-12-06 22:20:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:17,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:20:17,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:20:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:20:17,992 INFO L87 Difference]: Start difference. First operand 4602 states and 6803 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:23,195 INFO L93 Difference]: Finished difference Result 4601 states and 6800 transitions. [2021-12-06 22:20:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:20:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-12-06 22:20:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:23,200 INFO L225 Difference]: With dead ends: 4601 [2021-12-06 22:20:23,200 INFO L226 Difference]: Without dead ends: 4601 [2021-12-06 22:20:23,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-06 22:20:23,200 INFO L933 BasicCegarLoop]: 1716 mSDtfsCounter, 2 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4562 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:23,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4562 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-12-06 22:20:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2021-12-06 22:20:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4601. [2021-12-06 22:20:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 3924 states have (on average 1.7120285423037718) internal successors, (6718), 4560 states have internal predecessors, (6718), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 22:20:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 6800 transitions. [2021-12-06 22:20:23,236 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 6800 transitions. Word has length 67 [2021-12-06 22:20:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:23,236 INFO L470 AbstractCegarLoop]: Abstraction has 4601 states and 6800 transitions. [2021-12-06 22:20:23,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 6800 transitions. [2021-12-06 22:20:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 22:20:23,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:23,237 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-06 22:20:23,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-06 22:20:23,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:23,438 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2021-12-06 22:20:23,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:23,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494442402] [2021-12-06 22:20:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:23,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:23,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:23,444 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:23,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-06 22:20:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:23,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 22:20:23,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:23,750 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-06 22:20:23,758 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-06 22:20:23,777 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-06 22:20:23,784 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-06 22:20:23,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:23,784 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494442402] [2021-12-06 22:20:23,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494442402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:23,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:23,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:23,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640711551] [2021-12-06 22:20:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:23,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:20:23,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:23,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:20:23,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:20:23,785 INFO L87 Difference]: Start difference. First operand 4601 states and 6800 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:27,174 INFO L93 Difference]: Finished difference Result 4600 states and 6796 transitions. [2021-12-06 22:20:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:20:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-12-06 22:20:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:27,178 INFO L225 Difference]: With dead ends: 4600 [2021-12-06 22:20:27,178 INFO L226 Difference]: Without dead ends: 4600 [2021-12-06 22:20:27,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-06 22:20:27,179 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 4 mSDsluCounter, 2870 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4584 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:27,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 4584 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-06 22:20:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2021-12-06 22:20:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 4600. [2021-12-06 22:20:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 3924 states have (on average 1.7110091743119267) internal successors, (6714), 4559 states have internal predecessors, (6714), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 22:20:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6796 transitions. [2021-12-06 22:20:27,213 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6796 transitions. Word has length 67 [2021-12-06 22:20:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:27,213 INFO L470 AbstractCegarLoop]: Abstraction has 4600 states and 6796 transitions. [2021-12-06 22:20:27,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6796 transitions. [2021-12-06 22:20:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 22:20:27,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:27,214 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-06 22:20:27,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-06 22:20:27,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:27,415 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2021-12-06 22:20:27,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:27,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688614241] [2021-12-06 22:20:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:27,418 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:27,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:27,420 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:27,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-06 22:20:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:27,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 22:20:27,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:27,714 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-06 22:20:27,729 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-06 22:20:27,734 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-06 22:20:27,767 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-06 22:20:27,770 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-06 22:20:27,780 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-06 22:20:27,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:27,781 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:27,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688614241] [2021-12-06 22:20:27,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688614241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:27,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:27,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:27,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430773851] [2021-12-06 22:20:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:27,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:20:27,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:20:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:20:27,782 INFO L87 Difference]: Start difference. First operand 4600 states and 6796 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:32,609 INFO L93 Difference]: Finished difference Result 4599 states and 6792 transitions. [2021-12-06 22:20:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:20:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-12-06 22:20:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:32,613 INFO L225 Difference]: With dead ends: 4599 [2021-12-06 22:20:32,613 INFO L226 Difference]: Without dead ends: 4599 [2021-12-06 22:20:32,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-06 22:20:32,613 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 2 mSDsluCounter, 2843 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:32,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4557 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2021-12-06 22:20:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2021-12-06 22:20:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4599. [2021-12-06 22:20:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4599 states, 3920 states have (on average 1.711734693877551) internal successors, (6710), 4558 states have internal predecessors, (6710), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 22:20:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 6792 transitions. [2021-12-06 22:20:32,657 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 6792 transitions. Word has length 67 [2021-12-06 22:20:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:32,657 INFO L470 AbstractCegarLoop]: Abstraction has 4599 states and 6792 transitions. [2021-12-06 22:20:32,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 22:20:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 6792 transitions. [2021-12-06 22:20:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-06 22:20:32,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:32,659 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:32,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-06 22:20:32,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:32,860 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2062362287, now seen corresponding path program 1 times [2021-12-06 22:20:32,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:32,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873634429] [2021-12-06 22:20:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:32,865 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:32,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:32,867 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:32,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-06 22:20:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:33,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 22:20:33,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:33,182 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-06 22:20:33,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:20:33,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:33,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873634429] [2021-12-06 22:20:33,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873634429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:33,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:33,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:33,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264716337] [2021-12-06 22:20:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:33,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:33,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:33,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:33,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:33,183 INFO L87 Difference]: Start difference. First operand 4599 states and 6792 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-06 22:20:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:33,240 INFO L93 Difference]: Finished difference Result 4602 states and 6801 transitions. [2021-12-06 22:20:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2021-12-06 22:20:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:33,247 INFO L225 Difference]: With dead ends: 4602 [2021-12-06 22:20:33,247 INFO L226 Difference]: Without dead ends: 4602 [2021-12-06 22:20:33,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-06 22:20:33,248 INFO L933 BasicCegarLoop]: 1713 mSDtfsCounter, 2 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5131 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-06 22:20:33,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5131 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:20:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2021-12-06 22:20:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2021-12-06 22:20:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 3922 states have (on average 1.7116267210606833) internal successors, (6713), 4561 states have internal predecessors, (6713), 41 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:20:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6801 transitions. [2021-12-06 22:20:33,293 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6801 transitions. Word has length 75 [2021-12-06 22:20:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:33,293 INFO L470 AbstractCegarLoop]: Abstraction has 4602 states and 6801 transitions. [2021-12-06 22:20:33,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-06 22:20:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6801 transitions. [2021-12-06 22:20:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-06 22:20:33,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:33,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:33,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-12-06 22:20:33,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:33,496 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1092552202, now seen corresponding path program 1 times [2021-12-06 22:20:33,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753790510] [2021-12-06 22:20:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:33,499 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:33,502 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:33,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-06 22:20:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:33,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:20:33,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:33,828 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-06 22:20:33,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:20:33,915 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-06 22:20:33,915 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:33,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753790510] [2021-12-06 22:20:33,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753790510] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:20:33,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:20:33,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-06 22:20:33,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373310232] [2021-12-06 22:20:33,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:20:33,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:20:33,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:33,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:20:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:20:33,917 INFO L87 Difference]: Start difference. First operand 4602 states and 6801 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-06 22:20:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:34,080 INFO L93 Difference]: Finished difference Result 4614 states and 6823 transitions. [2021-12-06 22:20:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:20:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-06 22:20:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:34,092 INFO L225 Difference]: With dead ends: 4614 [2021-12-06 22:20:34,092 INFO L226 Difference]: Without dead ends: 4614 [2021-12-06 22:20:34,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 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-06 22:20:34,093 INFO L933 BasicCegarLoop]: 1713 mSDtfsCounter, 15 mSDsluCounter, 6827 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8540 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:34,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 8540 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:20:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2021-12-06 22:20:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4612. [2021-12-06 22:20:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 3931 states have (on average 1.7115237852963623) internal successors, (6728), 4570 states have internal predecessors, (6728), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:20:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6816 transitions. [2021-12-06 22:20:34,144 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6816 transitions. Word has length 76 [2021-12-06 22:20:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:34,145 INFO L470 AbstractCegarLoop]: Abstraction has 4612 states and 6816 transitions. [2021-12-06 22:20:34,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-06 22:20:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6816 transitions. [2021-12-06 22:20:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-06 22:20:34,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:34,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:34,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-06 22:20:34,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:34,346 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1024769937, now seen corresponding path program 2 times [2021-12-06 22:20:34,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:34,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369076497] [2021-12-06 22:20:34,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:20:34,347 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:34,348 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:34,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-06 22:20:34,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:20:34,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:20:34,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 22:20:34,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:34,847 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-06 22:20:34,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:20:35,037 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-06 22:20:35,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:35,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369076497] [2021-12-06 22:20:35,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369076497] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:20:35,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:20:35,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-06 22:20:35,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062837936] [2021-12-06 22:20:35,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:20:35,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 22:20:35,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 22:20:35,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:20:35,039 INFO L87 Difference]: Start difference. First operand 4612 states and 6816 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-06 22:20:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:35,638 INFO L93 Difference]: Finished difference Result 4633 states and 6864 transitions. [2021-12-06 22:20:35,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 22:20:35,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2021-12-06 22:20:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:35,646 INFO L225 Difference]: With dead ends: 4633 [2021-12-06 22:20:35,646 INFO L226 Difference]: Without dead ends: 4629 [2021-12-06 22:20:35,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-06 22:20:35,646 INFO L933 BasicCegarLoop]: 1716 mSDtfsCounter, 50 mSDsluCounter, 10264 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11980 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:35,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 11980 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 22:20:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2021-12-06 22:20:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4621. [2021-12-06 22:20:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 3940 states have (on average 1.7106598984771573) internal successors, (6740), 4579 states have internal predecessors, (6740), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:20:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 6828 transitions. [2021-12-06 22:20:35,684 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 6828 transitions. Word has length 79 [2021-12-06 22:20:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:35,684 INFO L470 AbstractCegarLoop]: Abstraction has 4621 states and 6828 transitions. [2021-12-06 22:20:35,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-06 22:20:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 6828 transitions. [2021-12-06 22:20:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-06 22:20:35,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:35,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:35,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-12-06 22:20:35,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:35,886 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash 876217103, now seen corresponding path program 3 times [2021-12-06 22:20:35,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133348424] [2021-12-06 22:20:35,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 22:20:35,890 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:35,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:35,892 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:35,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-06 22:20:36,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 22:20:36,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:20:36,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 22:20:36,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:36,797 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-06 22:20:36,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:20:37,436 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-06 22:20:37,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133348424] [2021-12-06 22:20:37,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133348424] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:20:37,437 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:20:37,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-06 22:20:37,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302019639] [2021-12-06 22:20:37,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:20:37,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 22:20:37,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 22:20:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-06 22:20:37,438 INFO L87 Difference]: Start difference. First operand 4621 states and 6828 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-06 22:20:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:40,827 INFO L93 Difference]: Finished difference Result 4663 states and 6965 transitions. [2021-12-06 22:20:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 22:20:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2021-12-06 22:20:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:40,834 INFO L225 Difference]: With dead ends: 4663 [2021-12-06 22:20:40,834 INFO L226 Difference]: Without dead ends: 4657 [2021-12-06 22:20:40,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 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-06 22:20:40,835 INFO L933 BasicCegarLoop]: 1720 mSDtfsCounter, 125 mSDsluCounter, 20567 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 22287 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.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:40,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 22287 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-06 22:20:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2021-12-06 22:20:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4639. [2021-12-06 22:20:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 3958 states have (on average 1.7086912582112177) internal successors, (6763), 4597 states have internal predecessors, (6763), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:20:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 6851 transitions. [2021-12-06 22:20:40,875 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 6851 transitions. Word has length 85 [2021-12-06 22:20:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:40,876 INFO L470 AbstractCegarLoop]: Abstraction has 4639 states and 6851 transitions. [2021-12-06 22:20:40,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-06 22:20:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 6851 transitions. [2021-12-06 22:20:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-06 22:20:40,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:40,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:40,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-06 22:20:41,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:41,078 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash -990633905, now seen corresponding path program 4 times [2021-12-06 22:20:41,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:41,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409501176] [2021-12-06 22:20:41,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 22:20:41,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:41,084 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:41,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-06 22:20:41,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 22:20:41,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:20:41,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-06 22:20:41,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:41,745 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-06 22:20:41,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:20:43,214 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-06 22:20:43,215 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:20:43,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409501176] [2021-12-06 22:20:43,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409501176] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:20:43,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:20:43,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-06 22:20:43,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588272872] [2021-12-06 22:20:43,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:20:43,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 22:20:43,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:20:43,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 22:20:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 22:20:43,217 INFO L87 Difference]: Start difference. First operand 4639 states and 6851 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-06 22:20:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:20:55,961 INFO L93 Difference]: Finished difference Result 4719 states and 7068 transitions. [2021-12-06 22:20:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-06 22:20:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2021-12-06 22:20:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:20:55,970 INFO L225 Difference]: With dead ends: 4719 [2021-12-06 22:20:55,970 INFO L226 Difference]: Without dead ends: 4715 [2021-12-06 22:20:55,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-06 22:20:55,974 INFO L933 BasicCegarLoop]: 1733 mSDtfsCounter, 419 mSDsluCounter, 41453 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 43186 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-06 22:20:55,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 43186 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-12-06 22:20:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2021-12-06 22:20:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4673. [2021-12-06 22:20:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4673 states, 3992 states have (on average 1.7056613226452906) internal successors, (6809), 4631 states have internal predecessors, (6809), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:20:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 6897 transitions. [2021-12-06 22:20:56,016 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 6897 transitions. Word has length 97 [2021-12-06 22:20:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:20:56,017 INFO L470 AbstractCegarLoop]: Abstraction has 4673 states and 6897 transitions. [2021-12-06 22:20:56,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-06 22:20:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 6897 transitions. [2021-12-06 22:20:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 22:20:56,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:20:56,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:56,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2021-12-06 22:20:56,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:20:56,218 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:20:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1014357521, now seen corresponding path program 5 times [2021-12-06 22:20:56,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:20:56,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520515349] [2021-12-06 22:20:56,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 22:20:56,219 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:20:56,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:20:56,220 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:20:56,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-06 22:20:57,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-06 22:20:57,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:20:57,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-06 22:20:57,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:20:57,502 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-06 22:20:57,584 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:20:57,584 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 23 treesize of output 30 [2021-12-06 22:20:57,622 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-06 22:20:57,721 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-06 22:20:58,307 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_17)))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_2633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2633) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:20:58,578 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_17)))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2640) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:20:59,251 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_17)))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_2656 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2656) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:20:59,763 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:20:59,764 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-06 22:20:59,839 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-06 22:20:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2021-12-06 22:20:59,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:21:00,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))) (_ bv1 1)))) is different from false [2021-12-06 22:21:00,085 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:21:00,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520515349] [2021-12-06 22:21:00,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520515349] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:21:00,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242499538] [2021-12-06 22:21:00,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 22:21:00,086 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:21:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:21:00,087 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:21:00,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-12-06 22:22:02,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-06 22:22:02,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:22:02,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-06 22:22:02,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:22:02,622 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-06 22:22:02,718 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:22:02,718 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 20 treesize of output 27 [2021-12-06 22:22:02,738 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-06 22:22:02,803 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-06 22:22:04,787 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:22:04,788 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-06 22:22:04,861 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-06 22:22:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-12-06 22:22:04,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:22:05,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242499538] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:22:05,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:22:05,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2021-12-06 22:22:05,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584866429] [2021-12-06 22:22:05,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:22:05,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 22:22:05,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:22:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 22:22:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=97, Unknown=14, NotChecked=92, Total=240 [2021-12-06 22:22:05,087 INFO L87 Difference]: Start difference. First operand 4673 states and 6897 transitions. Second operand has 12 states, 10 states have (on average 8.1) internal successors, (81), 12 states have internal predecessors, (81), 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-06 22:22:05,225 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2623) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_17)))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_2656 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2656) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2640) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2633) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:22:07,499 INFO L93 Difference]: Finished difference Result 6840 states and 10243 transitions. [2021-12-06 22:22:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:22:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.1) internal successors, (81), 12 states have internal predecessors, (81), 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 119 [2021-12-06 22:22:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:22:07,509 INFO L225 Difference]: With dead ends: 6840 [2021-12-06 22:22:07,509 INFO L226 Difference]: Without dead ends: 6836 [2021-12-06 22:22:07,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 142 SyntacticMatches, 88 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=39, Invalid=98, Unknown=15, NotChecked=120, Total=272 [2021-12-06 22:22:07,510 INFO L933 BasicCegarLoop]: 974 mSDtfsCounter, 1580 mSDsluCounter, 4279 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 5253 SdHoareTripleChecker+Invalid, 11625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10556 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:22:07,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 5253 Invalid, 11625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1057 Invalid, 0 Unknown, 10556 Unchecked, 2.3s Time] [2021-12-06 22:22:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2021-12-06 22:22:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 4721. [2021-12-06 22:22:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4721 states, 4040 states have (on average 1.6967821782178218) internal successors, (6855), 4678 states have internal predecessors, (6855), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:22:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4721 states to 4721 states and 6943 transitions. [2021-12-06 22:22:07,560 INFO L78 Accepts]: Start accepts. Automaton has 4721 states and 6943 transitions. Word has length 119 [2021-12-06 22:22:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:22:07,560 INFO L470 AbstractCegarLoop]: Abstraction has 4721 states and 6943 transitions. [2021-12-06 22:22:07,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.1) internal successors, (81), 12 states have internal predecessors, (81), 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-06 22:22:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4721 states and 6943 transitions. [2021-12-06 22:22:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 22:22:07,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:22:07,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:22:07,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2021-12-06 22:22:07,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-06 22:22:07,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:22:07,962 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:22:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:22:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1014357520, now seen corresponding path program 1 times [2021-12-06 22:22:07,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:22:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569438962] [2021-12-06 22:22:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:22:07,964 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:22:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:22:07,964 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:22:07,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-06 22:22:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:22:08,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-06 22:22:08,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:22:08,598 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-06 22:22:08,679 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:22:08,680 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-06 22:22:08,685 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-06 22:22:08,698 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-06 22:22:08,705 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-06 22:22:08,786 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-06 22:22:08,790 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-06 22:22:08,828 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551)))) is different from true [2021-12-06 22:22:08,896 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558)))) is different from true [2021-12-06 22:22:08,905 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:08,937 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:08,946 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:08,979 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:22:09,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:22:09,066 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,075 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,084 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,114 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,122 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,130 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,198 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:22:09,206 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,239 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603)))) is different from true [2021-12-06 22:22:09,247 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2021-12-06 22:22:09,258 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,268 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,278 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,287 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613)))) is different from true [2021-12-06 22:22:09,297 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,329 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3620))) (exists ((v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3619) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,358 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,366 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:22:09,374 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628)))) is different from true [2021-12-06 22:22:09,406 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:22:09,414 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3634) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3633) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:22:09,496 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:22:09,497 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-06 22:22:09,501 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-06 22:22:09,534 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-06 22:22:09,537 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-06 22:22:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2021-12-06 22:22:09,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:22:10,216 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (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~mem39#1.base| v_ArrVal_3730) |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~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-06 22:22:10,222 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:22:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569438962] [2021-12-06 22:22:10,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569438962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:22:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1938813418] [2021-12-06 22:22:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:22:10,222 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:22:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:22:10,223 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:22:10,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-12-06 22:23:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:23:59,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-06 22:23:59,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:23:59,334 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-06 22:23:59,417 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:23:59,417 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 14 treesize of output 14 [2021-12-06 22:23:59,421 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-06 22:23:59,431 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-06 22:23:59,438 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-06 22:23:59,481 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-06 22:23:59,484 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-06 22:23:59,517 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106)))) is different from true [2021-12-06 22:23:59,616 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:23:59,625 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:23:59,635 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:23:59,645 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:23:59,680 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:23:59,737 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133)))) is different from true [2021-12-06 22:23:59,767 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:23:59,775 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:23:59,784 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:23:59,793 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:23:59,873 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:23:59,882 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:23:59,915 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:23:59,950 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:24:00,042 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:00,103 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174)))) is different from true [2021-12-06 22:24:00,185 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 22:24:00,217 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:00,226 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:00,303 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:00,303 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-06 22:24:00,307 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-06 22:24:00,338 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-06 22:24:00,341 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-06 22:24:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2021-12-06 22:24:00,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:24:00,873 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |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 (_ bv20 32) .cse1))))) is different from false [2021-12-06 22:24:00,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1938813418] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:24:00,877 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:24:00,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 28] total 56 [2021-12-06 22:24:00,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080883479] [2021-12-06 22:24:00,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:24:00,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-06 22:24:00,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:24:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-06 22:24:00,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=129, Unknown=58, NotChecked=3350, Total=3660 [2021-12-06 22:24:00,880 INFO L87 Difference]: Start difference. First operand 4721 states and 6943 transitions. Second operand has 57 states, 55 states have (on average 2.6545454545454548) internal successors, (146), 57 states have internal predecessors, (146), 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-06 22:24:01,348 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551)))) is different from true [2021-12-06 22:24:01,360 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603))) (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3620))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3619) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:01,370 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4116) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4117 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4117) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603))) (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3620))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3619) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3633) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:24:08,832 INFO L93 Difference]: Finished difference Result 6837 states and 10238 transitions. [2021-12-06 22:24:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 22:24:08,833 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 2.6545454545454548) internal successors, (146), 57 states have internal predecessors, (146), 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 119 [2021-12-06 22:24:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:24:08,841 INFO L225 Difference]: With dead ends: 6837 [2021-12-06 22:24:08,841 INFO L226 Difference]: Without dead ends: 6837 [2021-12-06 22:24:08,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 143 SyntacticMatches, 43 SemanticMatches, 68 ConstructedPredicates, 53 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=167, Invalid=250, Unknown=67, NotChecked=4346, Total=4830 [2021-12-06 22:24:08,842 INFO L933 BasicCegarLoop]: 974 mSDtfsCounter, 1585 mSDsluCounter, 3735 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 4709 SdHoareTripleChecker+Invalid, 129930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125581 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-12-06 22:24:08,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1594 Valid, 4709 Invalid, 129930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4335 Invalid, 0 Unknown, 125581 Unchecked, 7.5s Time] [2021-12-06 22:24:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6837 states. [2021-12-06 22:24:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6837 to 4720. [2021-12-06 22:24:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4720 states, 4040 states have (on average 1.696039603960396) internal successors, (6852), 4677 states have internal predecessors, (6852), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2021-12-06 22:24:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 6940 transitions. [2021-12-06 22:24:08,884 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 6940 transitions. Word has length 119 [2021-12-06 22:24:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:24:08,885 INFO L470 AbstractCegarLoop]: Abstraction has 4720 states and 6940 transitions. [2021-12-06 22:24:08,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 2.6545454545454548) internal successors, (146), 57 states have internal predecessors, (146), 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-06 22:24:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 6940 transitions. [2021-12-06 22:24:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 22:24:08,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:24:08,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:24:08,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-06 22:24:09,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2021-12-06 22:24:09,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 22:24:09,287 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:24:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:24:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -955552741, now seen corresponding path program 1 times [2021-12-06 22:24:09,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:24:09,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091603163] [2021-12-06 22:24:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:24:09,288 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:24:09,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:24:09,289 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:24:09,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-06 22:24:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:24:09,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 22:24:09,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:24:09,916 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-06 22:24:09,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:24:09,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:24:09,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:24:09,963 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-06 22:24:09,964 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-06 22:24:10,027 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:24:10,027 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 16 treesize of output 16 [2021-12-06 22:24:10,093 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 42 treesize of output 38 [2021-12-06 22:24:10,157 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 42 treesize of output 38 [2021-12-06 22:24:10,206 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-06 22:24:10,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-06 22:24:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-12-06 22:24:10,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:24:10,280 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:24:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091603163] [2021-12-06 22:24:10,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091603163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:24:10,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:24:10,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:24:10,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78545812] [2021-12-06 22:24:10,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:24:10,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:24:10,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:24:10,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:24:10,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:24:10,281 INFO L87 Difference]: Start difference. First operand 4720 states and 6940 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-06 22:24:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:24:15,078 INFO L93 Difference]: Finished difference Result 4555 states and 6508 transitions. [2021-12-06 22:24:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:24:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2021-12-06 22:24:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:24:15,084 INFO L225 Difference]: With dead ends: 4555 [2021-12-06 22:24:15,084 INFO L226 Difference]: Without dead ends: 4555 [2021-12-06 22:24:15,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:24:15,085 INFO L933 BasicCegarLoop]: 1023 mSDtfsCounter, 1730 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 2463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-12-06 22:24:15,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1740 Valid, 3303 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-12-06 22:24:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2021-12-06 22:24:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4319. [2021-12-06 22:24:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 3640 states have (on average 1.7197802197802199) internal successors, (6260), 4279 states have internal predecessors, (6260), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 22:24:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 6341 transitions. [2021-12-06 22:24:15,120 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 6341 transitions. Word has length 119 [2021-12-06 22:24:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:24:15,121 INFO L470 AbstractCegarLoop]: Abstraction has 4319 states and 6341 transitions. [2021-12-06 22:24:15,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-06 22:24:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 6341 transitions. [2021-12-06 22:24:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-06 22:24:15,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:24:15,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:24:15,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-12-06 22:24:15,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:24:15,322 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:24:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:24:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash 665309305, now seen corresponding path program 1 times [2021-12-06 22:24:15,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:24:15,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797865836] [2021-12-06 22:24:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:24:15,323 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:24:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:24:15,324 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:24:15,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-06 22:24:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:24:16,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-06 22:24:16,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:24:16,053 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-06 22:24:16,143 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:24:16,143 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-06 22:24:16,172 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-06 22:24:16,276 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-06 22:24:16,377 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:16,493 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5045)))) is different from true [2021-12-06 22:24:16,989 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:17,102 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5060) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:17,684 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5075) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:18,117 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:18,118 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-06 22:24:18,200 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:18,200 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-06 22:24:18,227 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-06 22:24:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2021-12-06 22:24:18,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:24:18,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5086) |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-06 22:24:18,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))))) (_ bv0 1))) is different from false [2021-12-06 22:24:18,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:24:18,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5132))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:24:18,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:24:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797865836] [2021-12-06 22:24:18,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797865836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:24:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223229151] [2021-12-06 22:24:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:24:18,490 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:24:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:24:18,490 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:24:18,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2021-12-06 22:24:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:24:21,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-06 22:24:21,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:24:21,582 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-06 22:24:21,668 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:24:21,668 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 20 treesize of output 27 [2021-12-06 22:24:21,684 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-06 22:24:21,751 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-06 22:24:22,586 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:23,294 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:23,677 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:23,677 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-06 22:24:23,742 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:23,743 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-06 22:24:23,766 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-06 22:24:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2021-12-06 22:24:23,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:24:23,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) (_ bv1 1)))) is different from false [2021-12-06 22:24:24,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5556)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2021-12-06 22:24:24,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [223229151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:24:24,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:24:24,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2021-12-06 22:24:24,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816515445] [2021-12-06 22:24:24,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:24:24,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 22:24:24,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:24:24,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 22:24:24,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=124, Unknown=24, NotChecked=442, Total=650 [2021-12-06 22:24:24,023 INFO L87 Difference]: Start difference. First operand 4319 states and 6341 transitions. Second operand has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 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-06 22:24:24,118 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:24:26,413 INFO L93 Difference]: Finished difference Result 6386 states and 9580 transitions. [2021-12-06 22:24:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:24:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 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 122 [2021-12-06 22:24:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:24:26,419 INFO L225 Difference]: With dead ends: 6386 [2021-12-06 22:24:26,419 INFO L226 Difference]: Without dead ends: 6386 [2021-12-06 22:24:26,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 148 SyntacticMatches, 85 SemanticMatches, 25 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=62, Invalid=125, Unknown=25, NotChecked=490, Total=702 [2021-12-06 22:24:26,420 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 1574 mSDsluCounter, 6203 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 20605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19539 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:24:26,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1583 Valid, 7178 Invalid, 20605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1054 Invalid, 0 Unknown, 19539 Unchecked, 2.3s Time] [2021-12-06 22:24:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6386 states. [2021-12-06 22:24:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6386 to 4318. [2021-12-06 22:24:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4318 states, 3640 states have (on average 1.718956043956044) internal successors, (6257), 4278 states have internal predecessors, (6257), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 22:24:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 6338 transitions. [2021-12-06 22:24:26,457 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 6338 transitions. Word has length 122 [2021-12-06 22:24:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:24:26,457 INFO L470 AbstractCegarLoop]: Abstraction has 4318 states and 6338 transitions. [2021-12-06 22:24:26,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 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-06 22:24:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 6338 transitions. [2021-12-06 22:24:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-06 22:24:26,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:24:26,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:24:26,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2021-12-06 22:24:26,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2021-12-06 22:24:26,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:24:26,859 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:24:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:24:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 665309306, now seen corresponding path program 1 times [2021-12-06 22:24:26,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:24:26,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307831812] [2021-12-06 22:24:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:24:26,862 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:24:26,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:24:26,863 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:24:26,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-12-06 22:24:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:24:27,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-06 22:24:27,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:24:27,632 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-06 22:24:27,713 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:24:27,713 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-06 22:24:27,718 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-06 22:24:27,730 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-06 22:24:27,735 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-06 22:24:27,830 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-06 22:24:27,833 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-06 22:24:27,870 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:27,878 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986)))) is different from true [2021-12-06 22:24:27,956 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993)))) is different from true [2021-12-06 22:24:27,966 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:27,983 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997)))) is different from true [2021-12-06 22:24:27,994 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,005 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,089 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,118 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,167 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,176 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020))) (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,184 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023)))) is different from true [2021-12-06 22:24:28,265 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,274 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,329 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038)))) is different from true [2021-12-06 22:24:28,361 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,442 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,499 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,508 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,540 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2021-12-06 22:24:28,549 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:24:28,602 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:24:28,634 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:28,634 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-06 22:24:28,638 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-06 22:24:28,723 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:24:28,723 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-06 22:24:28,727 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-06 22:24:28,753 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-06 22:24:28,756 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-06 22:24:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2021-12-06 22:24:28,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:24:28,941 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-06 22:24:28,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 22:24:29,595 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164) .cse2 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 22:24:29,605 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:24:29,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307831812] [2021-12-06 22:24:29,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307831812] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:24:29,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [344539586] [2021-12-06 22:24:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:24:29,605 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:24:29,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:24:29,606 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:24:29,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2021-12-06 22:26:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:26:30,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-06 22:26:30,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:26:30,941 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-06 22:26:31,046 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:26:31,046 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-06 22:26:31,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, 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-06 22:26:31,059 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-06 22:26:31,067 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-06 22:26:31,108 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-06 22:26:31,111 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-06 22:26:31,144 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547)))) is different from true [2021-12-06 22:26:31,173 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,202 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,231 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:31,302 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,310 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,319 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:31,327 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,335 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6576)))) is different from true [2021-12-06 22:26:31,400 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582)))) is different from true [2021-12-06 22:26:31,436 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:31,445 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,591 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,599 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:31,648 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,699 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616)))) is different from true [2021-12-06 22:26:31,707 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32)))) is different from true [2021-12-06 22:26:31,715 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620))) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619)))) is different from true [2021-12-06 22:26:31,723 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6621) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6622) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:31,775 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:31,833 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634)))) is different from true [2021-12-06 22:26:31,866 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:26:31,866 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-06 22:26:31,870 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-06 22:26:31,918 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:26:31,918 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-06 22:26:31,922 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-06 22:26:31,942 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-06 22:26:31,945 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-06 22:26:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 714 not checked. [2021-12-06 22:26:31,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:26:31,995 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (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~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-06 22:26:32,025 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 22:26:32,668 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) .cse2 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 22:26:32,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [344539586] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:26:32,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:26:32,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 52 [2021-12-06 22:26:32,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871927362] [2021-12-06 22:26:32,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:26:32,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-06 22:26:32,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:26:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-06 22:26:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=148, Unknown=55, NotChecked=3332, Total=3660 [2021-12-06 22:26:32,680 INFO L87 Difference]: Start difference. First operand 4318 states and 6338 transitions. Second operand has 53 states, 51 states have (on average 2.823529411764706) internal successors, (144), 53 states have internal predecessors, (144), 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-06 22:26:33,138 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:33,141 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986)))) is different from true [2021-12-06 22:26:33,149 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2021-12-06 22:26:33,159 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616))) (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2021-12-06 22:26:33,171 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620))) (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616))) (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2021-12-06 22:26:33,183 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620))) (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616))) (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2021-12-06 22:26:33,195 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620))) (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6576))) (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616))) (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2021-12-06 22:26:33,204 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:26:42,749 INFO L93 Difference]: Finished difference Result 6385 states and 9577 transitions. [2021-12-06 22:26:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 22:26:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.823529411764706) internal successors, (144), 53 states have internal predecessors, (144), 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 122 [2021-12-06 22:26:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:26:42,754 INFO L225 Difference]: With dead ends: 6385 [2021-12-06 22:26:42,754 INFO L226 Difference]: Without dead ends: 6385 [2021-12-06 22:26:42,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 149 SyntacticMatches, 48 SemanticMatches, 74 ConstructedPredicates, 57 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=186, Invalid=314, Unknown=70, NotChecked=5130, Total=5700 [2021-12-06 22:26:42,756 INFO L933 BasicCegarLoop]: 977 mSDtfsCounter, 1583 mSDsluCounter, 4262 mSDsCounter, 0 mSdLazyCounter, 5452 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 5239 SdHoareTripleChecker+Invalid, 81902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76434 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-12-06 22:26:42,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1592 Valid, 5239 Invalid, 81902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5452 Invalid, 0 Unknown, 76434 Unchecked, 9.6s Time] [2021-12-06 22:26:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6385 states. [2021-12-06 22:26:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6385 to 4317. [2021-12-06 22:26:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3640 states have (on average 1.718131868131868) internal successors, (6254), 4277 states have internal predecessors, (6254), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 22:26:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6335 transitions. [2021-12-06 22:26:42,791 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6335 transitions. Word has length 122 [2021-12-06 22:26:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:26:42,791 INFO L470 AbstractCegarLoop]: Abstraction has 4317 states and 6335 transitions. [2021-12-06 22:26:42,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.823529411764706) internal successors, (144), 53 states have internal predecessors, (144), 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-06 22:26:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6335 transitions. [2021-12-06 22:26:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-06 22:26:42,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:26:42,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:26:42,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2021-12-06 22:26:43,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2021-12-06 22:26:43,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 22:26:43,194 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:26:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:26:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1044236073, now seen corresponding path program 1 times [2021-12-06 22:26:43,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:26:43,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89822619] [2021-12-06 22:26:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:26:43,197 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:26:43,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:26:43,197 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:26:43,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2021-12-06 22:26:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:26:44,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-06 22:26:44,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:26:44,220 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-06 22:26:44,293 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:26:44,293 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 14 treesize of output 14 [2021-12-06 22:26:44,297 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-06 22:26:44,321 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-06 22:26:44,330 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-06 22:26:44,410 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-06 22:26:44,412 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-06 22:26:44,449 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126)))) is different from true [2021-12-06 22:26:44,457 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7128))) (exists ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7127) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,465 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:44,473 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132)))) is different from true [2021-12-06 22:26:44,481 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7134 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7134))) (exists ((v_ArrVal_7133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7133) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:44,524 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,537 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,546 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,557 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,567 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,577 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7147) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,587 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:44,623 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:26:44,655 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:26:44,664 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,698 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163)))) is different from true [2021-12-06 22:26:44,708 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166)))) is different from true [2021-12-06 22:26:44,718 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168)))) is different from true [2021-12-06 22:26:44,777 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173)))) is different from true [2021-12-06 22:26:44,843 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179)))) is different from true [2021-12-06 22:26:44,901 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,932 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:44,996 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:26:45,027 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199)))) is different from true [2021-12-06 22:26:45,090 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:26:45,099 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:26:45,186 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:26:45,186 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-06 22:26:45,191 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-06 22:26:45,292 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:26:45,292 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-06 22:26:45,297 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-06 22:26:45,373 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:26:45,373 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-06 22:26:45,378 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-06 22:26:45,408 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-06 22:26:45,411 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-06 22:26:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2021-12-06 22:26:45,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:26:45,618 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (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~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-06 22:26:45,651 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))) is different from false [2021-12-06 22:26:45,845 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) .cse0 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-06 22:26:45,951 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7215)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7213))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7214) .cse4 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-06 22:26:47,600 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7213))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308) .cse0 v_ArrVal_7214) .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308) .cse6 v_ArrVal_7214) (select (select (store .cse7 .cse6 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_7215))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32)))))) is different from false [2021-12-06 22:26:47,612 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:26:47,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89822619] [2021-12-06 22:26:47,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89822619] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:26:47,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [684347473] [2021-12-06 22:26:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:26:47,612 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:26:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:26:47,613 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:26:47,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2021-12-06 22:27:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:27:36,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 117 conjunts are in the unsatisfiable core [2021-12-06 22:27:36,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:27:36,367 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-06 22:27:36,617 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:27:36,618 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 14 treesize of output 14 [2021-12-06 22:27:36,632 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-06 22:27:36,654 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-06 22:27:36,673 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-06 22:27:36,778 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-06 22:27:36,786 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-06 22:27:36,886 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7705) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7706))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:27:36,910 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7707) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7708) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:36,933 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7710) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7709) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:36,955 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:36,980 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,003 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,025 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,048 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,077 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7722))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7721) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,100 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:27:37,122 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,145 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7727) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,168 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,190 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,214 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734)))) is different from true [2021-12-06 22:27:37,237 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7735) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,260 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:27:37,283 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,305 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,384 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,463 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,485 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752)))) is different from true [2021-12-06 22:27:37,508 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,530 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:27:37,609 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760)))) is different from true [2021-12-06 22:27:37,632 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,655 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,678 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,701 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,725 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770)))) is different from true [2021-12-06 22:27:37,748 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772)))) is different from true [2021-12-06 22:27:37,770 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,794 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776)))) is different from true [2021-12-06 22:27:37,817 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778)))) is different from true [2021-12-06 22:27:37,841 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:37,864 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,887 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:37,910 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 22:27:37,933 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:38,014 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:38,094 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:27:38,095 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-06 22:27:38,103 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-06 22:27:38,214 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:27:38,214 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-06 22:27:38,222 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-06 22:27:38,314 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:27:38,315 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-06 22:27:38,323 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-06 22:27:38,368 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-06 22:27:38,376 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-06 22:27:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2021-12-06 22:27:38,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:27:38,471 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (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~mem42#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-06 22:27:38,516 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 22:27:38,602 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7793) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7794)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7793) .cse2 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 22:27:38,710 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7793) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7795)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7794))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7793) .cse4 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-06 22:27:40,360 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7888))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7887) .cse1 v_ArrVal_7793) (select (select (store .cse2 .cse1 v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7795))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7888)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7794))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7887) .cse4 v_ArrVal_7793) .cse5 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-06 22:27:40,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [684347473] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:27:40,371 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:27:40,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 50] total 76 [2021-12-06 22:27:40,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956411181] [2021-12-06 22:27:40,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:27:40,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-12-06 22:27:40,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:27:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-12-06 22:27:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=191, Unknown=86, NotChecked=7372, Total=7832 [2021-12-06 22:27:40,375 INFO L87 Difference]: Start difference. First operand 4317 states and 6335 transitions. Second operand has 77 states, 75 states have (on average 2.1866666666666665) internal successors, (164), 77 states have internal predecessors, (164), 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-06 22:27:41,238 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7705) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7706))) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126)))) is different from true [2021-12-06 22:27:41,248 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7707) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7128))) (exists ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7127) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7708) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:41,257 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7710) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7709) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:27:41,314 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7134 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7134))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7133) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173)))) is different from true [2021-12-06 22:27:41,327 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173)))) is different from true [2021-12-06 22:27:41,341 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173)))) is different from true [2021-12-06 22:27:41,356 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:41,371 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7722))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7721) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:41,386 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7147) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:27:41,401 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7147) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:28:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:28:01,319 INFO L93 Difference]: Finished difference Result 6391 states and 9588 transitions. [2021-12-06 22:28:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 22:28:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 2.1866666666666665) internal successors, (164), 77 states have internal predecessors, (164), 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 125 [2021-12-06 22:28:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:28:01,326 INFO L225 Difference]: With dead ends: 6391 [2021-12-06 22:28:01,327 INFO L226 Difference]: Without dead ends: 6391 [2021-12-06 22:28:01,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 157 SyntacticMatches, 27 SemanticMatches, 105 ConstructedPredicates, 86 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=255, Invalid=405, Unknown=104, NotChecked=10578, Total=11342 [2021-12-06 22:28:01,331 INFO L933 BasicCegarLoop]: 983 mSDtfsCounter, 1584 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 5455 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 122575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117102 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2021-12-06 22:28:01,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1593 Valid, 4682 Invalid, 122575 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 5455 Invalid, 0 Unknown, 117102 Unchecked, 19.8s Time] [2021-12-06 22:28:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2021-12-06 22:28:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 4316. [2021-12-06 22:28:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4316 states, 3640 states have (on average 1.7173076923076922) internal successors, (6251), 4276 states have internal predecessors, (6251), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 22:28:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 6332 transitions. [2021-12-06 22:28:01,374 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 6332 transitions. Word has length 125 [2021-12-06 22:28:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:28:01,374 INFO L470 AbstractCegarLoop]: Abstraction has 4316 states and 6332 transitions. [2021-12-06 22:28:01,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 2.1866666666666665) internal successors, (164), 77 states have internal predecessors, (164), 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-06 22:28:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 6332 transitions. [2021-12-06 22:28:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-06 22:28:01,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:28:01,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:28:01,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2021-12-06 22:28:01,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2021-12-06 22:28:01,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 22:28:01,777 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:28:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:28:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1044236074, now seen corresponding path program 1 times [2021-12-06 22:28:01,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:28:01,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526624452] [2021-12-06 22:28:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:28:01,779 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:28:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:28:01,780 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:28:01,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2021-12-06 22:28:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:28:02,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 22:28:02,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:28:02,775 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-06 22:28:03,068 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:28:03,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-06 22:28:03,143 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-06 22:28:03,388 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-06 22:28:04,790 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8293) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:28:08,492 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:28:08,493 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-06 22:28:08,720 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:28:08,720 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-06 22:28:08,922 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:28:08,923 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-06 22:28:08,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-06 22:28:09,081 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-06 22:28:09,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:28:09,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8328) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))) (_ bv1 1)))) is different from false [2021-12-06 22:28:09,229 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (_ bv1 1)))) is different from false [2021-12-06 22:28:09,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (_ bv1 1)))) is different from false [2021-12-06 22:28:09,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (_ bv1 1)))) is different from false [2021-12-06 22:28:09,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8374))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:28:09,668 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:28:09,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526624452] [2021-12-06 22:28:09,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526624452] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:28:09,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2065387165] [2021-12-06 22:28:09,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:28:09,668 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:28:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:28:09,669 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:28:09,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2021-12-06 22:29:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:29:01,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 22:29:01,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:29:01,255 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-06 22:29:01,549 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:29:01,550 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 21 treesize of output 28 [2021-12-06 22:29:01,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, 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-06 22:29:01,742 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-06 22:29:02,681 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8775) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:29:05,663 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8803)))) is different from true [2021-12-06 22:29:06,050 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8807) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:29:06,846 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:06,846 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-06 22:29:07,010 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:07,010 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-06 22:29:07,140 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:07,140 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-06 22:29:07,204 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-06 22:29:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2021-12-06 22:29:07,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:29:07,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (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~mem42#1.base| v_ArrVal_8814) |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-06 22:29:07,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:07,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2021-12-06 22:29:07,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:07,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8860))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8813)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:07,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2065387165] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:29:07,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:29:07,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 14 [2021-12-06 22:29:07,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287884388] [2021-12-06 22:29:07,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:29:07,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 22:29:07,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:29:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 22:29:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=125, Unknown=23, NotChecked=490, Total=702 [2021-12-06 22:29:07,809 INFO L87 Difference]: Start difference. First operand 4316 states and 6332 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 15 states have internal predecessors, (89), 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-06 22:29:07,935 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8803))) (exists ((v_ArrVal_8775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8293) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:29:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:29:07,995 INFO L93 Difference]: Finished difference Result 4321 states and 6335 transitions. [2021-12-06 22:29:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:29:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 15 states have internal predecessors, (89), 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 125 [2021-12-06 22:29:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:29:08,000 INFO L225 Difference]: With dead ends: 4321 [2021-12-06 22:29:08,000 INFO L226 Difference]: Without dead ends: 4321 [2021-12-06 22:29:08,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 155 SyntacticMatches, 88 SemanticMatches, 26 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=66, Invalid=126, Unknown=24, NotChecked=540, Total=756 [2021-12-06 22:29:08,001 INFO L933 BasicCegarLoop]: 1680 mSDtfsCounter, 13 mSDsluCounter, 4703 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6383 SdHoareTripleChecker+Invalid, 9963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9942 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:29:08,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 6383 Invalid, 9963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 9942 Unchecked, 0.1s Time] [2021-12-06 22:29:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2021-12-06 22:29:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4315. [2021-12-06 22:29:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4315 states, 3640 states have (on average 1.7164835164835164) internal successors, (6248), 4275 states have internal predecessors, (6248), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 22:29:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 6329 transitions. [2021-12-06 22:29:08,039 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 6329 transitions. Word has length 125 [2021-12-06 22:29:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:29:08,039 INFO L470 AbstractCegarLoop]: Abstraction has 4315 states and 6329 transitions. [2021-12-06 22:29:08,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 15 states have internal predecessors, (89), 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-06 22:29:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 6329 transitions. [2021-12-06 22:29:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-06 22:29:08,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:29:08,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:29:08,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2021-12-06 22:29:08,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (46)] Ended with exit code 0 [2021-12-06 22:29:08,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 22:29:08,442 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:29:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:29:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash -388418944, now seen corresponding path program 1 times [2021-12-06 22:29:08,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:29:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607006744] [2021-12-06 22:29:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:29:08,446 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:29:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:29:08,446 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:29:08,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2021-12-06 22:29:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:29:09,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 22:29:09,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:29:09,407 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-06 22:29:09,729 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:29:09,729 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 21 treesize of output 28 [2021-12-06 22:29:09,816 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-06 22:29:10,087 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-06 22:29:12,876 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9293) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:29:13,045 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9295) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:29:14,410 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9309) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:29:15,008 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:15,009 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 40 treesize of output 41 [2021-12-06 22:29:15,250 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:15,251 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-06 22:29:15,487 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:15,487 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-06 22:29:15,710 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:29:15,710 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-06 22:29:15,780 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-06 22:29:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2021-12-06 22:29:15,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:29:16,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:16,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:16,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:16,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:16,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:16,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9362))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9314)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:29:16,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:29:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607006744] [2021-12-06 22:29:16,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607006744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:29:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1162117297] [2021-12-06 22:29:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:29:16,632 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:29:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:29:16,633 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:29:16,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2021-12-06 22:30:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:30:22,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 22:30:22,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:30:22,896 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-06 22:30:23,187 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 22:30:23,187 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 21 treesize of output 28 [2021-12-06 22:30:23,242 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-06 22:30:23,383 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-06 22:30:24,054 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9776) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))))) is different from true [2021-12-06 22:30:27,746 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9811 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9811) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:28,367 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:28,368 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-06 22:30:28,594 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:28,595 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-06 22:30:28,717 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:28,717 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-06 22:30:28,863 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:28,864 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-06 22:30:28,916 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-06 22:30:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2021-12-06 22:30:28,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:30:28,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_9818) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))) (_ bv1 1)))) is different from false [2021-12-06 22:30:29,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:30:29,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2021-12-06 22:30:29,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2021-12-06 22:30:29,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9816))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:30:29,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9816))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 22:30:29,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9864))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9816)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))))) is different from false [2021-12-06 22:30:29,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1162117297] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:30:29,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:30:29,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2021-12-06 22:30:29,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375525778] [2021-12-06 22:30:29,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:30:29,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 22:30:29,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 22:30:29,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 22:30:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=171, Unknown=31, NotChecked=774, Total=1056 [2021-12-06 22:30:29,535 INFO L87 Difference]: Start difference. First operand 4315 states and 6329 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 17 states have internal predecessors, (94), 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-06 22:30:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:30:34,080 INFO L93 Difference]: Finished difference Result 6382 states and 9568 transitions. [2021-12-06 22:30:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:30:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 17 states have internal predecessors, (94), 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 128 [2021-12-06 22:30:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:30:34,087 INFO L225 Difference]: With dead ends: 6382 [2021-12-06 22:30:34,087 INFO L226 Difference]: Without dead ends: 6382 [2021-12-06 22:30:34,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 160 SyntacticMatches, 90 SemanticMatches, 31 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=80, Invalid=171, Unknown=31, NotChecked=774, Total=1056 [2021-12-06 22:30:34,088 INFO L933 BasicCegarLoop]: 976 mSDtfsCounter, 1566 mSDsluCounter, 8377 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 9353 SdHoareTripleChecker+Invalid, 21495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20435 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-06 22:30:34,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1575 Valid, 9353 Invalid, 21495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1048 Invalid, 0 Unknown, 20435 Unchecked, 4.4s Time] [2021-12-06 22:30:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2021-12-06 22:30:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 4314. [2021-12-06 22:30:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 3640 states have (on average 1.7156593406593406) internal successors, (6245), 4274 states have internal predecessors, (6245), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 22:30:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 6326 transitions. [2021-12-06 22:30:34,131 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 6326 transitions. Word has length 128 [2021-12-06 22:30:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:30:34,132 INFO L470 AbstractCegarLoop]: Abstraction has 4314 states and 6326 transitions. [2021-12-06 22:30:34,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 17 states have internal predecessors, (94), 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-06 22:30:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 6326 transitions. [2021-12-06 22:30:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-06 22:30:34,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:30:34,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:30:34,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (48)] Ended with exit code 0 [2021-12-06 22:30:34,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2021-12-06 22:30:34,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 22:30:34,534 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 986 more)] === [2021-12-06 22:30:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:30:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash -388418943, now seen corresponding path program 1 times [2021-12-06 22:30:34,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 22:30:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487580787] [2021-12-06 22:30:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:30:34,537 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 22:30:34,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 22:30:34,538 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 22:30:34,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2021-12-06 22:30:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:30:35,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-06 22:30:35,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:30:35,581 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-06 22:30:35,829 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-06 22:30:35,855 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:30:35,856 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-06 22:30:35,897 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-06 22:30:35,918 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-06 22:30:36,092 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-06 22:30:36,098 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-06 22:30:36,201 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10277) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10276) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:36,224 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10279) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10278) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:36,247 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10280) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:36,269 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10282)))) is different from true [2021-12-06 22:30:36,445 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10289))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10288) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:36,529 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10292) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10293)))) is different from true [2021-12-06 22:30:36,553 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10294))) (exists ((v_ArrVal_10295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10295) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:36,577 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10297) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10296)))) is different from true [2021-12-06 22:30:36,604 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10298) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10299) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:30:36,628 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10300))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10301) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:36,654 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10302) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10303) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:30:36,863 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10310) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10311) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:30:37,017 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10316) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:30:37,170 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10323))) (exists ((v_ArrVal_10322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10322))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147)))) is different from true [2021-12-06 22:30:37,251 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10327) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:37,385 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10332) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10333)))) is different from true [2021-12-06 22:30:37,461 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10336) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10337) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:37,542 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10341) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10340)))) is different from true [2021-12-06 22:30:37,789 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10351))) (exists ((v_ArrVal_10350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10350) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:37,813 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10352))) (exists ((v_ArrVal_10353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10353) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:37,836 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10355 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10355) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10354) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 22:30:37,921 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10359) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10358) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 22:30:38,109 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:38,109 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-06 22:30:38,118 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-06 22:30:38,300 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:38,301 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-06 22:30:38,308 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-06 22:30:38,478 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:38,478 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-06 22:30:38,491 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-06 22:30:38,665 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:30:38,665 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-06 22:30:38,674 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-06 22:30:38,719 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-06 22:30:38,725 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-06 22:30:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2021-12-06 22:30:38,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:30:39,072 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (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~mem43#1.base| v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32)))))) is different from false [2021-12-06 22:30:39,118 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))) is different from false [2021-12-06 22:30:39,240 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10366)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10367) .cse0 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10367) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32)))))) is different from false [2021-12-06 22:30:39,336 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10366))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10367) .cse1 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10367) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_10369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-06 22:30:40,151 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10364)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10366))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10365) .cse0 v_ArrVal_10367) .cse1 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10364))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10365) .cse6 v_ArrVal_10367) (select (select (store .cse7 .cse6 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_10369))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32)))))) is different from false [2021-12-06 22:30:41,174 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10364))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10365) .cse2 v_ArrVal_10367) (select (select (store .cse3 .cse2 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10369)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10364))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_10366))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10365) .cse6 v_ArrVal_10367) .cse7 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-06 22:30:44,750 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10461))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10364))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10460) .cse1 v_ArrVal_10365) .cse2 v_ArrVal_10367) (select (select (store .cse3 .cse2 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10369))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10461)) (.cse9 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10364))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10366))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10460) .cse6 v_ArrVal_10365) .cse7 v_ArrVal_10367) .cse8 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-06 22:30:44,799 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 22:30:44,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487580787] [2021-12-06 22:30:44,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487580787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:30:44,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1488050620] [2021-12-06 22:30:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:30:44,799 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 22:30:44,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 22:30:44,800 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 22:30:44,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0fb189b-55de-4c89-95fb-2872568e1140/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process