./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8 --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 cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:11:54,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:11:54,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:11:54,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:11:54,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:11:54,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:11:54,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:11:54,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:11:54,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:11:54,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:11:54,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:11:54,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:11:54,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:11:54,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:11:54,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:11:54,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:11:54,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:11:54,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:11:54,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:11:54,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:11:54,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:11:54,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:11:54,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:11:54,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:11:54,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:11:54,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:11:54,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:11:54,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:11:54,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:11:54,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:11:54,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:11:54,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:11:54,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:11:54,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:11:54,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:11:54,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:11:54,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:11:54,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:11:54,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:11:54,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:11:54,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:11:54,815 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:11:54,849 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:11:54,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:11:54,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:11:54,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:11:54,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:11:54,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:11:54,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:11:54,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:11:54,857 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:11:54,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:11:54,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:11:54,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:11:54,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:11:54,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:11:54,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:11:54,860 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:11:54,860 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:11:54,860 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:11:54,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:11:54,861 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:11:54,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:11:54,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:11:54,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:11:54,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:11:54,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:11:54,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:11:54,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:11:54,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:11:54,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:11:54,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:11:54,865 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2022-11-16 11:11:55,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:11:55,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:11:55,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:11:55,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:11:55,214 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:11:55,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-16 11:11:55,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/262452d87/6522a31a8b444422abd0b550364b3a77/FLAG5a0a44ae7 [2022-11-16 11:11:55,827 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:11:55,827 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-16 11:11:55,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/262452d87/6522a31a8b444422abd0b550364b3a77/FLAG5a0a44ae7 [2022-11-16 11:11:56,087 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/262452d87/6522a31a8b444422abd0b550364b3a77 [2022-11-16 11:11:56,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:11:56,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:11:56,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:11:56,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:11:56,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:11:56,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:11:56" (1/1) ... [2022-11-16 11:11:56,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13cea539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:56, skipping insertion in model container [2022-11-16 11:11:56,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:11:56" (1/1) ... [2022-11-16 11:11:56,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:11:56,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:11:56,645 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-16 11:11:56,780 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-16 11:11:56,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:11:56,816 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-16 11:11:56,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59cb0f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:56, skipping insertion in model container [2022-11-16 11:11:56,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:11:56,817 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 11:11:56,819 INFO L158 Benchmark]: Toolchain (without parser) took 727.08ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 75.0MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:11:56,820 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:11:56,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.34ms. Allocated memory is still 113.2MB. Free memory was 71.3MB in the beginning and 75.5MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:11:56,822 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.21ms. Allocated memory is still 113.2MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.34ms. Allocated memory is still 113.2MB. Free memory was 71.3MB in the beginning and 75.5MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8 --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 cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:11:58,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:11:58,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:11:59,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:11:59,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:11:59,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:11:59,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:11:59,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:11:59,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:11:59,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:11:59,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:11:59,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:11:59,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:11:59,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:11:59,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:11:59,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:11:59,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:11:59,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:11:59,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:11:59,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:11:59,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:11:59,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:11:59,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:11:59,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:11:59,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:11:59,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:11:59,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:11:59,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:11:59,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:11:59,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:11:59,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:11:59,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:11:59,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:11:59,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:11:59,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:11:59,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:11:59,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:11:59,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:11:59,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:11:59,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:11:59,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:11:59,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:11:59,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:11:59,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:11:59,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:11:59,136 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:11:59,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:11:59,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:11:59,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:11:59,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:11:59,139 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:11:59,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:11:59,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:11:59,141 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:11:59,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:11:59,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:11:59,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:11:59,142 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:11:59,142 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:11:59,142 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:11:59,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:11:59,143 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:11:59,143 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:11:59,143 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:11:59,143 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:11:59,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:11:59,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:11:59,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:11:59,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:11:59,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:11:59,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:11:59,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:11:59,146 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:11:59,146 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:11:59,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:11:59,147 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2022-11-16 11:11:59,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:11:59,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:11:59,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:11:59,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:11:59,608 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:11:59,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-16 11:11:59,678 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/a64250b82/9a90811daf2f469e89920c763eba9980/FLAG787e6d71a [2022-11-16 11:12:00,349 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:12:00,350 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-16 11:12:00,381 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/a64250b82/9a90811daf2f469e89920c763eba9980/FLAG787e6d71a [2022-11-16 11:12:00,570 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/data/a64250b82/9a90811daf2f469e89920c763eba9980 [2022-11-16 11:12:00,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:12:00,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:12:00,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:12:00,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:12:00,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:12:00,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:12:00" (1/1) ... [2022-11-16 11:12:00,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f53d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:00, skipping insertion in model container [2022-11-16 11:12:00,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:12:00" (1/1) ... [2022-11-16 11:12:00,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:12:00,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:12:01,050 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-16 11:12:01,261 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-16 11:12:01,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:01,320 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 11:12:01,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:12:01,353 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-16 11:12:01,426 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-16 11:12:01,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:01,450 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:12:01,502 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-16 11:12:01,604 WARN L229 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_b5c247b1-6c3e-44b2-b19b-e02bc159de68/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-16 11:12:01,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:01,654 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:12:01,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01 WrapperNode [2022-11-16 11:12:01,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:12:01,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:12:01,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:12:01,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:12:01,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:01,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:01,840 INFO L138 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1713 [2022-11-16 11:12:01,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:12:01,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:12:01,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:12:01,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:12:01,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:01,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:01,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:01,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:02,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:02,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:02,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:02,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:02,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:12:02,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:12:02,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:12:02,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:12:02,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (1/1) ... [2022-11-16 11:12:02,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:12:02,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:12:02,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:12:02,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:12:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 11:12:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:12:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:12:02,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:12:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 11:12:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 11:12:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:12:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:12:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:12:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:12:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-16 11:12:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:12:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:12:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:12:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:12:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:12:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:12:02,513 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:12:02,515 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:12:02,517 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 11:12:10,660 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:12:10,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:12:10,690 INFO L300 CfgBuilder]: Removed 100 assume(true) statements. [2022-11-16 11:12:10,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:10 BoogieIcfgContainer [2022-11-16 11:12:10,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:12:10,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:12:10,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:12:10,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:12:10,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:12:00" (1/3) ... [2022-11-16 11:12:10,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770cac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:12:10, skipping insertion in model container [2022-11-16 11:12:10,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:01" (2/3) ... [2022-11-16 11:12:10,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770cac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:12:10, skipping insertion in model container [2022-11-16 11:12:10,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:10" (3/3) ... [2022-11-16 11:12:10,709 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-3.i [2022-11-16 11:12:10,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:12:10,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-11-16 11:12:10,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:12:10,812 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fcabc4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:12:10,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-11-16 11:12:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 1831 states, 891 states have (on average 2.2648709315375983) internal successors, (2018), 1822 states have internal predecessors, (2018), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:12:10,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:10,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:12:10,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-16 11:12:10,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864380837] [2022-11-16 11:12:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:10,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:10,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:12:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:11,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:12:11,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:11,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:11,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:11,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864380837] [2022-11-16 11:12:11,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864380837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:11,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:11,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508064097] [2022-11-16 11:12:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:12:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:12:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:12:11,200 INFO L87 Difference]: Start difference. First operand has 1831 states, 891 states have (on average 2.2648709315375983) internal successors, (2018), 1822 states have internal predecessors, (2018), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:11,317 INFO L93 Difference]: Finished difference Result 1813 states and 1913 transitions. [2022-11-16 11:12:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:12:11,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:12:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:11,356 INFO L225 Difference]: With dead ends: 1813 [2022-11-16 11:12:11,357 INFO L226 Difference]: Without dead ends: 1811 [2022-11-16 11:12:11,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:12:11,363 INFO L413 NwaCegarLoop]: 1913 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:11,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:12:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-11-16 11:12:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-11-16 11:12:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 882 states have (on average 2.1417233560090705) internal successors, (1889), 1802 states have internal predecessors, (1889), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1911 transitions. [2022-11-16 11:12:11,487 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1911 transitions. Word has length 5 [2022-11-16 11:12:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:11,487 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 1911 transitions. [2022-11-16 11:12:11,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1911 transitions. [2022-11-16 11:12:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:12:11,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:11,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:12:11,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:11,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:11,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-16 11:12:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:11,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738029634] [2022-11-16 11:12:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:11,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:11,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:11,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:11,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:12:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:11,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:12:11,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:11,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:12:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:12,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:12,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:12,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738029634] [2022-11-16 11:12:12,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738029634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:12,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:12,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534264402] [2022-11-16 11:12:12,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:12,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:12,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:12,027 INFO L87 Difference]: Start difference. First operand 1811 states and 1911 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:15,982 INFO L93 Difference]: Finished difference Result 2067 states and 2210 transitions. [2022-11-16 11:12:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:15,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:12:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:16,008 INFO L225 Difference]: With dead ends: 2067 [2022-11-16 11:12:16,008 INFO L226 Difference]: Without dead ends: 2067 [2022-11-16 11:12:16,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:16,010 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 1365 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:16,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1805 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-16 11:12:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-11-16 11:12:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1796. [2022-11-16 11:12:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 958 states have (on average 2.0177453027139873) internal successors, (1933), 1787 states have internal predecessors, (1933), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 1955 transitions. [2022-11-16 11:12:16,066 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 1955 transitions. Word has length 5 [2022-11-16 11:12:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:16,066 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 1955 transitions. [2022-11-16 11:12:16,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 1955 transitions. [2022-11-16 11:12:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:12:16,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:16,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:12:16,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:16,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:16,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-16 11:12:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:16,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552322304] [2022-11-16 11:12:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:16,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:16,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:12:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:16,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:12:16,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:16,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:12:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:16,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:16,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552322304] [2022-11-16 11:12:16,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552322304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:16,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:16,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910431257] [2022-11-16 11:12:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:16,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:16,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:16,496 INFO L87 Difference]: Start difference. First operand 1796 states and 1955 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:22,176 INFO L93 Difference]: Finished difference Result 2316 states and 2525 transitions. [2022-11-16 11:12:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:12:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:22,184 INFO L225 Difference]: With dead ends: 2316 [2022-11-16 11:12:22,184 INFO L226 Difference]: Without dead ends: 2316 [2022-11-16 11:12:22,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:22,186 INFO L413 NwaCegarLoop]: 1742 mSDtfsCounter, 741 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:22,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2540 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-16 11:12:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-11-16 11:12:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1952. [2022-11-16 11:12:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1124 states have (on average 1.9919928825622777) internal successors, (2239), 1943 states have internal predecessors, (2239), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2261 transitions. [2022-11-16 11:12:22,260 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2261 transitions. Word has length 5 [2022-11-16 11:12:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:22,261 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 2261 transitions. [2022-11-16 11:12:22,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2261 transitions. [2022-11-16 11:12:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:12:22,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:22,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:12:22,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:22,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:22,462 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-16 11:12:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:22,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123837840] [2022-11-16 11:12:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:22,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:22,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:12:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:22,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:12:22,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:22,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:22,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:22,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123837840] [2022-11-16 11:12:22,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123837840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:22,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:22,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932635232] [2022-11-16 11:12:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:22,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:22,666 INFO L87 Difference]: Start difference. First operand 1952 states and 2261 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:22,847 INFO L93 Difference]: Finished difference Result 3510 states and 4109 transitions. [2022-11-16 11:12:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:22,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:12:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:22,864 INFO L225 Difference]: With dead ends: 3510 [2022-11-16 11:12:22,864 INFO L226 Difference]: Without dead ends: 3510 [2022-11-16 11:12:22,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:22,870 INFO L413 NwaCegarLoop]: 2310 mSDtfsCounter, 1373 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 4110 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:22,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 4110 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2022-11-16 11:12:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 1954. [2022-11-16 11:12:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.9902309058614565) internal successors, (2241), 1945 states have internal predecessors, (2241), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2263 transitions. [2022-11-16 11:12:22,929 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2263 transitions. Word has length 6 [2022-11-16 11:12:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:22,930 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2263 transitions. [2022-11-16 11:12:22,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2263 transitions. [2022-11-16 11:12:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:12:22,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:22,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:22,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:23,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:23,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-16 11:12:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:23,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455561578] [2022-11-16 11:12:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:23,156 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:23,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:12:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:23,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:12:23,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:23,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:23,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:23,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455561578] [2022-11-16 11:12:23,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455561578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:23,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:23,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454236095] [2022-11-16 11:12:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:23,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:23,379 INFO L87 Difference]: Start difference. First operand 1954 states and 2263 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) [2022-11-16 11:12:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:23,428 INFO L93 Difference]: Finished difference Result 1918 states and 2226 transitions. [2022-11-16 11:12:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:23,428 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 [2022-11-16 11:12:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:23,435 INFO L225 Difference]: With dead ends: 1918 [2022-11-16 11:12:23,435 INFO L226 Difference]: Without dead ends: 1918 [2022-11-16 11:12:23,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:23,436 INFO L413 NwaCegarLoop]: 1762 mSDtfsCounter, 1732 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1790 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 [2022-11-16 11:12:23,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1790 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:12:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-11-16 11:12:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1912. [2022-11-16 11:12:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1108 states have (on average 1.983754512635379) internal successors, (2198), 1903 states have internal predecessors, (2198), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2220 transitions. [2022-11-16 11:12:23,473 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2220 transitions. Word has length 11 [2022-11-16 11:12:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:23,473 INFO L495 AbstractCegarLoop]: Abstraction has 1912 states and 2220 transitions. [2022-11-16 11:12:23,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2220 transitions. [2022-11-16 11:12:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:12:23,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:23,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:23,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:23,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:23,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-16 11:12:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321338628] [2022-11-16 11:12:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:23,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:23,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:23,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:23,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:12:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:23,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:12:23,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:23,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:23,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321338628] [2022-11-16 11:12:23,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321338628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:23,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:23,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:12:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654395563] [2022-11-16 11:12:23,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:23,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:23,971 INFO L87 Difference]: Start difference. First operand 1912 states and 2220 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) [2022-11-16 11:12:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:24,091 INFO L93 Difference]: Finished difference Result 1897 states and 2198 transitions. [2022-11-16 11:12:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:24,092 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 [2022-11-16 11:12:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:24,098 INFO L225 Difference]: With dead ends: 1897 [2022-11-16 11:12:24,098 INFO L226 Difference]: Without dead ends: 1897 [2022-11-16 11:12:24,099 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:12:24,099 INFO L413 NwaCegarLoop]: 1717 mSDtfsCounter, 1713 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:24,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 3455 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-11-16 11:12:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1890. [2022-11-16 11:12:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1100 states have (on average 1.971818181818182) internal successors, (2169), 1881 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2191 transitions. [2022-11-16 11:12:24,134 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2191 transitions. Word has length 13 [2022-11-16 11:12:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:24,134 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 2191 transitions. [2022-11-16 11:12:24,134 INFO L496 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) [2022-11-16 11:12:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2191 transitions. [2022-11-16 11:12:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:12:24,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:24,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:24,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:24,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:24,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-16 11:12:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802145156] [2022-11-16 11:12:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:24,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:24,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 11:12:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:24,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:12:24,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:24,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:12:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:24,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:24,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:24,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802145156] [2022-11-16 11:12:24,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802145156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:24,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:24,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782921504] [2022-11-16 11:12:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:24,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:24,669 INFO L87 Difference]: Start difference. First operand 1890 states and 2191 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) [2022-11-16 11:12:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:30,796 INFO L93 Difference]: Finished difference Result 3103 states and 3449 transitions. [2022-11-16 11:12:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:12:30,797 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 [2022-11-16 11:12:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:30,808 INFO L225 Difference]: With dead ends: 3103 [2022-11-16 11:12:30,809 INFO L226 Difference]: Without dead ends: 3103 [2022-11-16 11:12:30,809 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:12:30,810 INFO L413 NwaCegarLoop]: 1067 mSDtfsCounter, 3372 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:30,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 2416 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-16 11:12:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2022-11-16 11:12:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 1886. [2022-11-16 11:12:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1100 states have (on average 1.9681818181818183) internal successors, (2165), 1877 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2187 transitions. [2022-11-16 11:12:30,861 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2187 transitions. Word has length 27 [2022-11-16 11:12:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:30,862 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 2187 transitions. [2022-11-16 11:12:30,862 INFO L496 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) [2022-11-16 11:12:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2187 transitions. [2022-11-16 11:12:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:12:30,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:30,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:30,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:31,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:31,075 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-16 11:12:31,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:31,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037339061] [2022-11-16 11:12:31,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:31,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:31,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:31,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:31,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 11:12:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:31,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:12:31,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:31,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:12:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:31,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:31,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037339061] [2022-11-16 11:12:31,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037339061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:31,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:31,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594534743] [2022-11-16 11:12:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:31,488 INFO L87 Difference]: Start difference. First operand 1886 states and 2187 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) [2022-11-16 11:12:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:39,251 INFO L93 Difference]: Finished difference Result 2632 states and 2851 transitions. [2022-11-16 11:12:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:12:39,252 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 [2022-11-16 11:12:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:39,259 INFO L225 Difference]: With dead ends: 2632 [2022-11-16 11:12:39,259 INFO L226 Difference]: Without dead ends: 2632 [2022-11-16 11:12:39,260 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:12:39,260 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 1687 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:39,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2873 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-16 11:12:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2022-11-16 11:12:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 1882. [2022-11-16 11:12:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1100 states have (on average 1.9645454545454546) internal successors, (2161), 1873 states have internal predecessors, (2161), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2183 transitions. [2022-11-16 11:12:39,299 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2183 transitions. Word has length 27 [2022-11-16 11:12:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:39,299 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2183 transitions. [2022-11-16 11:12:39,300 INFO L496 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) [2022-11-16 11:12:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2183 transitions. [2022-11-16 11:12:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 11:12:39,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:39,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:39,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:39,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:39,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-16 11:12:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:39,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039656553] [2022-11-16 11:12:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:39,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:39,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 11:12:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:39,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:12:39,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:39,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:39,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:39,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039656553] [2022-11-16 11:12:39,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039656553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:39,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:39,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:12:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439936735] [2022-11-16 11:12:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:39,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:39,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:39,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:39,888 INFO L87 Difference]: Start difference. First operand 1882 states and 2183 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:39,959 INFO L93 Difference]: Finished difference Result 1882 states and 2179 transitions. [2022-11-16 11:12:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:39,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-16 11:12:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:39,965 INFO L225 Difference]: With dead ends: 1882 [2022-11-16 11:12:39,965 INFO L226 Difference]: Without dead ends: 1882 [2022-11-16 11:12:39,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:39,968 INFO L413 NwaCegarLoop]: 1711 mSDtfsCounter, 1682 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:39,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3433 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:12:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-11-16 11:12:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1876. [2022-11-16 11:12:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1094 states have (on average 1.9661791590493602) internal successors, (2151), 1867 states have internal predecessors, (2151), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2173 transitions. [2022-11-16 11:12:40,008 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2173 transitions. Word has length 42 [2022-11-16 11:12:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:40,010 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2173 transitions. [2022-11-16 11:12:40,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2173 transitions. [2022-11-16 11:12:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 11:12:40,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:40,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:40,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:40,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:40,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-16 11:12:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:40,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511391528] [2022-11-16 11:12:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:40,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:40,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:40,240 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:40,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 11:12:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:40,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:12:40,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:40,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:40,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:40,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511391528] [2022-11-16 11:12:40,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511391528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:40,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:40,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17102337] [2022-11-16 11:12:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:40,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:40,807 INFO L87 Difference]: Start difference. First operand 1876 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:41,089 INFO L93 Difference]: Finished difference Result 2295 states and 2609 transitions. [2022-11-16 11:12:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:41,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-16 11:12:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:41,100 INFO L225 Difference]: With dead ends: 2295 [2022-11-16 11:12:41,100 INFO L226 Difference]: Without dead ends: 2295 [2022-11-16 11:12:41,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:41,101 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 455 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:41,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3374 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:12:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2022-11-16 11:12:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1922. [2022-11-16 11:12:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1140 states have (on average 1.9271929824561405) internal successors, (2197), 1913 states have internal predecessors, (2197), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2219 transitions. [2022-11-16 11:12:41,157 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2219 transitions. Word has length 50 [2022-11-16 11:12:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:41,157 INFO L495 AbstractCegarLoop]: Abstraction has 1922 states and 2219 transitions. [2022-11-16 11:12:41,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2219 transitions. [2022-11-16 11:12:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:12:41,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:41,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:41,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:41,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:41,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-16 11:12:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:41,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253760154] [2022-11-16 11:12:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:41,376 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:41,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 11:12:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:41,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:12:41,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:41,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:12:41,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:12:42,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:12:42,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:12:42,456 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:12:42,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 11:12:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:42,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:42,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253760154] [2022-11-16 11:12:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253760154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:42,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738888512] [2022-11-16 11:12:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:42,482 INFO L87 Difference]: Start difference. First operand 1922 states and 2219 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:48,037 INFO L93 Difference]: Finished difference Result 2109 states and 2390 transitions. [2022-11-16 11:12:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-16 11:12:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:48,061 INFO L225 Difference]: With dead ends: 2109 [2022-11-16 11:12:48,061 INFO L226 Difference]: Without dead ends: 2109 [2022-11-16 11:12:48,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:48,062 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 1569 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:48,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1304 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-16 11:12:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-11-16 11:12:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1672. [2022-11-16 11:12:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 974 states have (on average 1.8439425051334701) internal successors, (1796), 1663 states have internal predecessors, (1796), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1818 transitions. [2022-11-16 11:12:48,095 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1818 transitions. Word has length 53 [2022-11-16 11:12:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:48,096 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1818 transitions. [2022-11-16 11:12:48,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1818 transitions. [2022-11-16 11:12:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:12:48,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:48,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:48,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:48,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:48,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-16 11:12:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:48,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405926482] [2022-11-16 11:12:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:48,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:48,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:48,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:48,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 11:12:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:48,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:12:48,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:48,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:12:48,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:12:48,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-16 11:12:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:48,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:48,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405926482] [2022-11-16 11:12:48,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405926482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:48,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:48,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:12:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684823280] [2022-11-16 11:12:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:48,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:48,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:48,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:48,736 INFO L87 Difference]: Start difference. First operand 1672 states and 1818 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:53,945 INFO L93 Difference]: Finished difference Result 1671 states and 1817 transitions. [2022-11-16 11:12:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:12:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-16 11:12:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:53,951 INFO L225 Difference]: With dead ends: 1671 [2022-11-16 11:12:53,951 INFO L226 Difference]: Without dead ends: 1671 [2022-11-16 11:12:53,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:12:53,952 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 4 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:53,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4144 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-16 11:12:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-11-16 11:12:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2022-11-16 11:12:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 974 states have (on average 1.8429158110882957) internal successors, (1795), 1662 states have internal predecessors, (1795), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:12:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1817 transitions. [2022-11-16 11:12:53,979 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1817 transitions. Word has length 58 [2022-11-16 11:12:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:53,980 INFO L495 AbstractCegarLoop]: Abstraction has 1671 states and 1817 transitions. [2022-11-16 11:12:53,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1817 transitions. [2022-11-16 11:12:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:12:53,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:53,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:53,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:54,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:54,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:12:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-16 11:12:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:12:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371822329] [2022-11-16 11:12:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:54,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:12:54,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:12:54,198 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:12:54,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 11:12:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:54,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:12:54,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:54,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:12:54,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:12:54,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:12:54,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-16 11:12:54,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 11:12:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:54,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:12:54,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:12:54,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371822329] [2022-11-16 11:12:54,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371822329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:54,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:54,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:12:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966039566] [2022-11-16 11:12:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:54,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:12:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:54,680 INFO L87 Difference]: Start difference. First operand 1671 states and 1817 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:13:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:01,811 INFO L93 Difference]: Finished difference Result 1670 states and 1816 transitions. [2022-11-16 11:13:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:13:01,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-16 11:13:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:01,816 INFO L225 Difference]: With dead ends: 1670 [2022-11-16 11:13:01,816 INFO L226 Difference]: Without dead ends: 1670 [2022-11-16 11:13:01,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:13:01,817 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 2 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:01,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4202 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-16 11:13:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-11-16 11:13:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2022-11-16 11:13:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 973 states have (on average 1.8437821171634121) internal successors, (1794), 1661 states have internal predecessors, (1794), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 11:13:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 1816 transitions. [2022-11-16 11:13:01,843 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 1816 transitions. Word has length 58 [2022-11-16 11:13:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:01,843 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 1816 transitions. [2022-11-16 11:13:01,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:13:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1816 transitions. [2022-11-16 11:13:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 11:13:01,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:01,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:01,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-16 11:13:02,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:02,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:13:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2024861438, now seen corresponding path program 1 times [2022-11-16 11:13:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:13:02,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136899041] [2022-11-16 11:13:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:13:02,063 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:13:02,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 11:13:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:02,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:13:02,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:02,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:13:02,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:13:02,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136899041] [2022-11-16 11:13:02,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136899041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:02,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:02,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:13:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842263409] [2022-11-16 11:13:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:13:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:13:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:13:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:13:02,453 INFO L87 Difference]: Start difference. First operand 1670 states and 1816 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:13:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:02,532 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-11-16 11:13:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:13:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-16 11:13:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:02,552 INFO L225 Difference]: With dead ends: 1673 [2022-11-16 11:13:02,552 INFO L226 Difference]: Without dead ends: 1673 [2022-11-16 11:13:02,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:13:02,553 INFO L413 NwaCegarLoop]: 1630 mSDtfsCounter, 2 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4882 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 [2022-11-16 11:13:02,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4882 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-11-16 11:13:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-11-16 11:13:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 975 states have (on average 1.843076923076923) internal successors, (1797), 1664 states have internal predecessors, (1797), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:13:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-11-16 11:13:02,605 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 66 [2022-11-16 11:13:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:02,605 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-11-16 11:13:02,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:13:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-11-16 11:13:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 11:13:02,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:02,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:02,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:02,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:02,829 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:13:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1657441321, now seen corresponding path program 1 times [2022-11-16 11:13:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:13:02,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894028442] [2022-11-16 11:13:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:02,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:02,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:13:02,832 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:13:02,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 11:13:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:03,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:13:03,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:03,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:03,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:13:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894028442] [2022-11-16 11:13:03,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894028442] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:03,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:13:03,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 11:13:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135493223] [2022-11-16 11:13:03,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:03,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:13:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:13:03,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:13:03,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:13:03,335 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:03,608 INFO L93 Difference]: Finished difference Result 1685 states and 1839 transitions. [2022-11-16 11:13:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:13:03,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-16 11:13:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:03,613 INFO L225 Difference]: With dead ends: 1685 [2022-11-16 11:13:03,613 INFO L226 Difference]: Without dead ends: 1685 [2022-11-16 11:13:03,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:13:03,614 INFO L413 NwaCegarLoop]: 1630 mSDtfsCounter, 22 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6503 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:03,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6503 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:13:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2022-11-16 11:13:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2022-11-16 11:13:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 984 states have (on average 1.8414634146341464) internal successors, (1812), 1673 states have internal predecessors, (1812), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:13:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1836 transitions. [2022-11-16 11:13:03,645 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1836 transitions. Word has length 67 [2022-11-16 11:13:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:03,645 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 1836 transitions. [2022-11-16 11:13:03,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1836 transitions. [2022-11-16 11:13:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 11:13:03,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:03,647 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:13:03,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:03,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:03,861 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:13:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1206395586, now seen corresponding path program 2 times [2022-11-16 11:13:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:13:03,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438589952] [2022-11-16 11:13:03,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:13:03,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:13:03,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:13:03,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 11:13:04,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:13:04,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:04,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:13:04,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:04,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:04,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:13:04,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438589952] [2022-11-16 11:13:04,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438589952] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:04,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:13:04,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 11:13:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681456699] [2022-11-16 11:13:04,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:04,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:13:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:13:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:13:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:13:04,736 INFO L87 Difference]: Start difference. First operand 1683 states and 1836 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:05,652 INFO L93 Difference]: Finished difference Result 1704 states and 1868 transitions. [2022-11-16 11:13:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:13:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-11-16 11:13:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:05,657 INFO L225 Difference]: With dead ends: 1704 [2022-11-16 11:13:05,657 INFO L226 Difference]: Without dead ends: 1700 [2022-11-16 11:13:05,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-16 11:13:05,659 INFO L413 NwaCegarLoop]: 1633 mSDtfsCounter, 62 mSDsluCounter, 8143 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 9776 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:05,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 9776 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:13:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2022-11-16 11:13:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1692. [2022-11-16 11:13:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 993 states have (on average 1.836858006042296) internal successors, (1824), 1682 states have internal predecessors, (1824), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:13:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 1848 transitions. [2022-11-16 11:13:05,689 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 1848 transitions. Word has length 70 [2022-11-16 11:13:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:05,690 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 1848 transitions. [2022-11-16 11:13:05,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 1848 transitions. [2022-11-16 11:13:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 11:13:05,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:05,691 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:13:05,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-16 11:13:05,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:05,907 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:13:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -365877602, now seen corresponding path program 3 times [2022-11-16 11:13:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:13:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352815017] [2022-11-16 11:13:05,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:13:05,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:13:05,909 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:13:05,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-16 11:13:06,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 11:13:06,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:06,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:13:06,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:06,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:08,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:13:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352815017] [2022-11-16 11:13:08,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352815017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:08,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:13:08,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 11:13:08,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490739976] [2022-11-16 11:13:08,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:08,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:13:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:13:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:13:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:13:08,250 INFO L87 Difference]: Start difference. First operand 1692 states and 1848 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:13,284 INFO L93 Difference]: Finished difference Result 1734 states and 1924 transitions. [2022-11-16 11:13:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 11:13:13,285 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-16 11:13:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:13,289 INFO L225 Difference]: With dead ends: 1734 [2022-11-16 11:13:13,289 INFO L226 Difference]: Without dead ends: 1728 [2022-11-16 11:13:13,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 11:13:13,291 INFO L413 NwaCegarLoop]: 1637 mSDtfsCounter, 160 mSDsluCounter, 17951 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 19588 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:13,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 19588 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-16 11:13:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-11-16 11:13:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1710. [2022-11-16 11:13:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1011 states have (on average 1.8269040553907023) internal successors, (1847), 1700 states have internal predecessors, (1847), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:13:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1871 transitions. [2022-11-16 11:13:13,322 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 1871 transitions. Word has length 76 [2022-11-16 11:13:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:13,322 INFO L495 AbstractCegarLoop]: Abstraction has 1710 states and 1871 transitions. [2022-11-16 11:13:13,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 1871 transitions. [2022-11-16 11:13:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 11:13:13,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:13,324 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:13:13,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:13,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:13,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:13:13,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2057559714, now seen corresponding path program 4 times [2022-11-16 11:13:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:13:13,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828145286] [2022-11-16 11:13:13,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:13:13,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:13,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:13:13,542 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:13:13,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-16 11:13:13,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:13:13,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:13,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:13:13,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:14,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:16,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:13:16,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828145286] [2022-11-16 11:13:16,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828145286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:16,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:13:16,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-16 11:13:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078177320] [2022-11-16 11:13:16,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:16,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:13:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:13:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:13:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 11:13:16,953 INFO L87 Difference]: Start difference. First operand 1710 states and 1871 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:31,083 INFO L93 Difference]: Finished difference Result 1790 states and 2004 transitions. [2022-11-16 11:13:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 11:13:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-11-16 11:13:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:31,088 INFO L225 Difference]: With dead ends: 1790 [2022-11-16 11:13:31,088 INFO L226 Difference]: Without dead ends: 1786 [2022-11-16 11:13:31,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-16 11:13:31,092 INFO L413 NwaCegarLoop]: 1650 mSDtfsCounter, 458 mSDsluCounter, 42705 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 44355 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:31,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 44355 Invalid, 3512 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [385 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-16 11:13:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2022-11-16 11:13:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1744. [2022-11-16 11:13:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1045 states have (on average 1.8114832535885168) internal successors, (1893), 1734 states have internal predecessors, (1893), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:13:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 1917 transitions. [2022-11-16 11:13:31,123 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 1917 transitions. Word has length 88 [2022-11-16 11:13:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:31,124 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 1917 transitions. [2022-11-16 11:13:31,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:13:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 1917 transitions. [2022-11-16 11:13:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 11:13:31,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:31,125 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:13:31,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:31,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:31,343 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:13:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1917799358, now seen corresponding path program 5 times [2022-11-16 11:13:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:13:31,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510495481] [2022-11-16 11:13:31,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:13:31,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:13:31,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:13:31,346 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:13:31,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-16 11:13:32,808 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 11:13:32,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:32,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 11:13:32,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:32,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:13:33,021 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:13:33,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:13:33,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:13:33,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-16 11:13:33,746 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1609)))) is different from true [2022-11-16 11:13:33,975 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1615) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:13:34,950 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1641) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:13:35,089 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:13:35,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:13:35,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-16 11:13:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-16 11:13:35,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:35,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-16 11:13:35,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:13:35,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510495481] [2022-11-16 11:13:35,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510495481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:35,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [899996862] [2022-11-16 11:13:35,587 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:13:35,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:13:35,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:13:35,589 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:13:35,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-16 11:14:50,297 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 11:14:50,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:14:50,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 11:14:50,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:50,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:14:50,712 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:14:50,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:14:50,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:14:50,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-16 11:14:52,361 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2087)))) is different from true [2022-11-16 11:14:52,581 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:14:52,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:14:52,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-16 11:14:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-16 11:14:52,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:14:52,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2137) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-16 11:14:52,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [899996862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:52,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:14:52,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2022-11-16 11:14:52,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414473147] [2022-11-16 11:14:52,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:14:52,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:14:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:52,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:14:52,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=82, Unknown=14, NotChecked=138, Total=272 [2022-11-16 11:14:52,947 INFO L87 Difference]: Start difference. First operand 1744 states and 1917 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 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) [2022-11-16 11:14:53,293 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1609))) (exists ((v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2087))) (exists ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1641) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:15:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:00,315 INFO L93 Difference]: Finished difference Result 2067 states and 2227 transitions. [2022-11-16 11:15:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:15:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 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 110 [2022-11-16 11:15:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:00,319 INFO L225 Difference]: With dead ends: 2067 [2022-11-16 11:15:00,319 INFO L226 Difference]: Without dead ends: 2063 [2022-11-16 11:15:00,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 125 SyntacticMatches, 86 SemanticMatches, 19 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=59, Invalid=133, Unknown=18, NotChecked=210, Total=420 [2022-11-16 11:15:00,320 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 1140 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 5375 SdHoareTripleChecker+Invalid, 12584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9625 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:00,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 5375 Invalid, 12584 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2948 Invalid, 0 Unknown, 9625 Unchecked, 7.1s Time] [2022-11-16 11:15:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-11-16 11:15:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1792. [2022-11-16 11:15:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1093 states have (on average 1.7758462946020128) internal successors, (1941), 1781 states have internal predecessors, (1941), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:15:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 1965 transitions. [2022-11-16 11:15:00,366 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 1965 transitions. Word has length 110 [2022-11-16 11:15:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:00,367 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 1965 transitions. [2022-11-16 11:15:00,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 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) [2022-11-16 11:15:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 1965 transitions. [2022-11-16 11:15:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 11:15:00,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:00,368 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:15:00,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:00,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:00,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:15:00,796 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:15:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1917799359, now seen corresponding path program 1 times [2022-11-16 11:15:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:15:00,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371404899] [2022-11-16 11:15:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:00,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:15:00,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:15:00,800 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:15:00,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-16 11:15:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:01,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 11:15:01,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:01,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:15:01,940 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:15:01,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 11:15:01,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:15:01,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:15:01,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:15:02,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:15:02,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 11:15:02,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:02,207 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-11-16 11:15:02,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-11-16 11:15:02,281 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:15:02,295 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:15:02,482 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-11-16 11:15:02,586 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:15:02,598 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531)))) is different from true [2022-11-16 11:15:02,610 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:02,624 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-11-16 11:15:02,669 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:15:02,780 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:15:02,793 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:02,806 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:15:02,935 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:15:02,979 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:03,057 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567)))) is different from true [2022-11-16 11:15:03,100 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:03,281 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:03,295 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:15:03,341 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:15:03,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 11:15:03,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:15:03,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:15:03,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 11:15:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-11-16 11:15:03,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:15:04,532 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:15:04,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:15:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371404899] [2022-11-16 11:15:04,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371404899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [399891880] [2022-11-16 11:15:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:15:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:15:04,547 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:15:04,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-16 11:16:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:55,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 11:16:55,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:55,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:16:55,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:16:55,254 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:16:55,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 11:16:55,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:16:55,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:16:55,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:16:55,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 11:16:55,420 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,470 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,515 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047)))) is different from true [2022-11-16 11:16:55,527 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,543 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,556 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,569 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055)))) is different from true [2022-11-16 11:16:55,583 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:16:55,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,682 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064)))) is different from true [2022-11-16 11:16:55,694 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:55,771 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:16:55,949 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085)))) is different from true [2022-11-16 11:16:56,028 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,042 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,123 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,166 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103)))) is different from true [2022-11-16 11:16:56,177 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108)))) is different from true [2022-11-16 11:16:56,236 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,250 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113)))) is different from true [2022-11-16 11:16:56,263 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,277 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:56,327 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:56,482 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:16:56,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 11:16:56,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:16:56,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:16:56,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 11:16:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2022-11-16 11:16:56,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:57,452 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-16 11:16:57,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [399891880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:57,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:16:57,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 52 [2022-11-16 11:16:57,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173774995] [2022-11-16 11:16:57,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:57,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 11:16:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:16:57,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 11:16:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=126, Unknown=53, NotChecked=2898, Total=3192 [2022-11-16 11:16:57,461 INFO L87 Difference]: Start difference. First operand 1792 states and 1965 transitions. Second operand has 53 states, 51 states have (on average 2.607843137254902) internal successors, (133), 53 states have internal predecessors, (133), 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) [2022-11-16 11:16:57,993 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-16 11:16:57,998 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,015 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,029 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,062 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,082 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,099 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:16:58,104 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:10,216 INFO L93 Difference]: Finished difference Result 2062 states and 2220 transitions. [2022-11-16 11:17:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:17:10,217 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.607843137254902) internal successors, (133), 53 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2022-11-16 11:17:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:10,221 INFO L225 Difference]: With dead ends: 2062 [2022-11-16 11:17:10,221 INFO L226 Difference]: Without dead ends: 2062 [2022-11-16 11:17:10,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 125 SyntacticMatches, 46 SemanticMatches, 70 ConstructedPredicates, 55 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=253, Unknown=68, NotChecked=4620, Total=5112 [2022-11-16 11:17:10,223 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 1134 mSDsluCounter, 4052 mSDsCounter, 0 mSdLazyCounter, 5064 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 79052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73976 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:10,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 5102 Invalid, 79052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 5064 Invalid, 0 Unknown, 73976 Unchecked, 12.1s Time] [2022-11-16 11:17:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-11-16 11:17:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1791. [2022-11-16 11:17:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1093 states have (on average 1.7749313815187557) internal successors, (1940), 1780 states have internal predecessors, (1940), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:17:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 1964 transitions. [2022-11-16 11:17:10,270 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 1964 transitions. Word has length 110 [2022-11-16 11:17:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:10,271 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 1964 transitions. [2022-11-16 11:17:10,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.607843137254902) internal successors, (133), 53 states have internal predecessors, (133), 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) [2022-11-16 11:17:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 1964 transitions. [2022-11-16 11:17:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-16 11:17:10,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:10,273 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:17:10,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-11-16 11:17:10,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:10,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:17:10,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:17:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1505974903, now seen corresponding path program 1 times [2022-11-16 11:17:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:10,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823060423] [2022-11-16 11:17:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:10,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:17:10,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:10,698 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:17:10,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-16 11:17:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:11,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 11:17:11,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:11,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:17:11,770 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:17:11,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:17:11,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:17:11,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-16 11:17:12,929 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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 [2022-11-16 11:17:13,671 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:17:13,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:17:13,791 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:17:13,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:17:13,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-16 11:17:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-16 11:17:13,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:13,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-16 11:17:16,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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~mem33#1.base| v_ArrVal_3672))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3626)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:17:16,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823060423] [2022-11-16 11:17:16,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823060423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [916176181] [2022-11-16 11:17:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:17:16,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:17:16,345 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:17:16,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-16 11:17:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:20,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 11:17:20,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:20,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:17:20,657 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:17:20,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:17:20,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:17:20,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-16 11:17:21,173 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4045)))) is different from true [2022-11-16 11:17:21,396 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4051) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:17:21,565 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4056)))) is different from true [2022-11-16 11:17:21,777 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4061)))) is different from true [2022-11-16 11:17:22,549 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:17:22,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:17:22,642 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:17:22,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:17:22,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-16 11:17:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-16 11:17:22,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:24,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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_4081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 11:17:25,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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~mem33#1.base| v_ArrVal_4127))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4081)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:17:25,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [916176181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:25,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:25,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 14 [2022-11-16 11:17:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678832723] [2022-11-16 11:17:25,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:25,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:17:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:17:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=138, Unknown=23, NotChecked=288, Total=506 [2022-11-16 11:17:25,107 INFO L87 Difference]: Start difference. First operand 1791 states and 1964 transitions. Second operand has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 15 states have internal predecessors, (79), 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) [2022-11-16 11:17:25,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4061))) (exists ((v_ArrVal_4056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4056))) (exists ((v_ArrVal_4045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4045))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4051) |c_#memory_$Pointer$.base|)) (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 [2022-11-16 11:17:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:33,296 INFO L93 Difference]: Finished difference Result 2061 states and 2219 transitions. [2022-11-16 11:17:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:17:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 15 states have internal predecessors, (79), 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 113 [2022-11-16 11:17:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:33,301 INFO L225 Difference]: With dead ends: 2061 [2022-11-16 11:17:33,301 INFO L226 Difference]: Without dead ends: 2061 [2022-11-16 11:17:33,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 132 SyntacticMatches, 85 SemanticMatches, 25 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=80, Invalid=205, Unknown=27, NotChecked=390, Total=702 [2022-11-16 11:17:33,302 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 1138 mSDsluCounter, 4307 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 14192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11230 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:33,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 5356 Invalid, 14192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2950 Invalid, 0 Unknown, 11230 Unchecked, 7.9s Time] [2022-11-16 11:17:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2022-11-16 11:17:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1790. [2022-11-16 11:17:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1093 states have (on average 1.7740164684354987) internal successors, (1939), 1779 states have internal predecessors, (1939), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:17:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 1963 transitions. [2022-11-16 11:17:33,329 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 1963 transitions. Word has length 113 [2022-11-16 11:17:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:33,330 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 1963 transitions. [2022-11-16 11:17:33,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 15 states have internal predecessors, (79), 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) [2022-11-16 11:17:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 1963 transitions. [2022-11-16 11:17:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-16 11:17:33,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:33,331 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:17:33,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:33,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:33,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:17:33,754 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:17:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1505974904, now seen corresponding path program 1 times [2022-11-16 11:17:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:33,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349946875] [2022-11-16 11:17:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:17:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:33,757 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:17:33,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-16 11:17:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:34,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-16 11:17:34,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:34,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:17:34,984 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:17:34,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 11:17:34,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:17:35,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:17:35,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:17:35,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:17:35,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 11:17:35,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495)))) is different from true [2022-11-16 11:17:35,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496)))) is different from true [2022-11-16 11:17:35,287 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501)))) is different from true [2022-11-16 11:17:35,300 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:35,313 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4504) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4505)))) is different from true [2022-11-16 11:17:35,325 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4507))) (exists ((v_ArrVal_4506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4506)))) is different from true [2022-11-16 11:17:35,434 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-16 11:17:35,479 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518)))) is different from true [2022-11-16 11:17:35,593 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526)))) is different from true [2022-11-16 11:17:35,684 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532)))) is different from true [2022-11-16 11:17:35,699 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4535))) (exists ((v_ArrVal_4534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4534) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:17:35,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4536) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4537)))) is different from true [2022-11-16 11:17:35,729 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4539))) (exists ((v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4538) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:35,814 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544)))) is different from true [2022-11-16 11:17:35,827 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4546))) (exists ((v_ArrVal_4547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4547)))) is different from true [2022-11-16 11:17:35,839 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4549) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4548)))) is different from true [2022-11-16 11:17:35,852 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4550))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4551)))) is different from true [2022-11-16 11:17:35,905 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4555))) (exists ((v_ArrVal_4554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4554)))) is different from true [2022-11-16 11:17:35,988 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-16 11:17:36,002 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4560))) (exists ((v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4561) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:36,017 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4562))) (exists ((v_ArrVal_4563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4563)))) is different from true [2022-11-16 11:17:36,032 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4564))) (exists ((v_ArrVal_4565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4565) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:36,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4566))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4567) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:17:36,097 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4571) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4570)))) is different from true [2022-11-16 11:17:36,110 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4572))) (exists ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4573)))) is different from true [2022-11-16 11:17:36,171 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:17:36,304 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:17:36,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 11:17:36,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:17:36,454 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:17:36,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 11:17:36,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:17:36,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 11:17:36,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:17:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-11-16 11:17:36,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:36,746 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4583) |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~mem35#1.base| v_ArrVal_4582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:17:36,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 11:17:37,808 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4675))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4674) .cse0 v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4674) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-16 11:17:37,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:37,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349946875] [2022-11-16 11:17:37,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349946875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:37,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679025885] [2022-11-16 11:17:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:37,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:17:37,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:17:37,819 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:17:37,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-16 11:17:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:42,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-16 11:17:42,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:42,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:17:42,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:17:43,454 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:17:43,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 11:17:43,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:17:43,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:17:43,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:17:43,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-16 11:17:43,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:17:43,899 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043)))) is different from true [2022-11-16 11:17:43,912 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5044) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:43,924 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5045)))) is different from true [2022-11-16 11:17:44,767 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056)))) is different from true [2022-11-16 11:17:44,852 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058)))) is different from true [2022-11-16 11:17:45,306 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065)))) is different from true [2022-11-16 11:17:45,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:46,479 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:17:46,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:17:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:47,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-16 11:17:47,062 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-16 11:17:47,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-16 11:17:47,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:17:47,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:17:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-16 11:17:47,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:47,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-11-16 11:17:54,297 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_5136 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5136))) (let ((.cse1 (select |c_#length| v_arrayElimCell_65)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (forall ((v_ArrVal_5088 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv8 32) (select (select (store .cse3 v_arrayElimCell_65 (store (select .cse3 v_arrayElimCell_65) (bvadd (_ bv16 32) .cse0) v_ArrVal_5088)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_5087 (_ BitVec 32))) (bvule .cse2 (select |c_#length| v_ArrVal_5087))) (bvule .cse2 .cse1)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_5136 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5136))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse5 (_ bv20 32)) (select |c_#length| v_arrayElimCell_65))) (forall ((v_prenex_6 (_ BitVec 32))) (let ((.cse6 (select (select (store .cse7 v_arrayElimCell_65 (store (select .cse7 v_arrayElimCell_65) (bvadd (_ bv16 32) .cse5) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse6) (bvadd (_ bv8 32) .cse6)))))))))) is different from false [2022-11-16 11:17:54,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1679025885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:54,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:54,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19] total 53 [2022-11-16 11:17:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608299633] [2022-11-16 11:17:54,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:54,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 11:17:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 11:17:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=488, Unknown=75, NotChecked=3078, Total=3782 [2022-11-16 11:17:54,327 INFO L87 Difference]: Start difference. First operand 1790 states and 1963 transitions. Second operand has 54 states, 51 states have (on average 3.627450980392157) internal successors, (185), 54 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:17:55,711 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_ArrVal_4571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4571) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518))) (exists ((v_ArrVal_5044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5044) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4555))) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4554))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4570)))) is different from true [2022-11-16 11:17:55,720 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_ArrVal_4571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4571) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4546))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4535))) (exists ((v_ArrVal_4560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4560))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4534) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4572))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_5045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5045))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4573))) (exists ((v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518))) (exists ((v_ArrVal_4555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4555))) (exists ((v_ArrVal_4547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4547))) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4554))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4570)))) is different from true [2022-11-16 11:17:55,731 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_ArrVal_4549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4571) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4546))) (exists ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4562))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4535))) (exists ((v_ArrVal_4560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4560))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4563))) (exists ((v_ArrVal_4534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4534) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4548))) (exists ((v_ArrVal_4504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4504) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4572))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4573))) (exists ((v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4536) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4537))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518))) (exists ((v_ArrVal_4555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4555))) (exists ((v_ArrVal_4547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4547))) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4554))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532))) (exists ((v_ArrVal_4505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4505))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4570)))) is different from true [2022-11-16 11:17:55,742 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4550))) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_ArrVal_4549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4571) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4546))) (exists ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4562))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4535))) (exists ((v_ArrVal_4560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4560))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4563))) (exists ((v_ArrVal_4534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4534) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4548))) (exists ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4539))) (exists ((v_ArrVal_4504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4504) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4572))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4573))) (exists ((v_ArrVal_4564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4564))) (exists ((v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4507))) (exists ((v_ArrVal_4536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4536) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4537))) (exists ((v_ArrVal_4551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4551))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518))) (exists ((v_ArrVal_4555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4555))) (exists ((v_ArrVal_4547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4547))) (exists ((v_ArrVal_4565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4565) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4554))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532))) (exists ((v_ArrVal_4505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4505))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4570))) (exists ((v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4506)))) is different from true [2022-11-16 11:17:55,755 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4550))) (exists ((v_ArrVal_4566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4566))) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4558))) (exists ((v_ArrVal_4559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4559))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514))) (exists ((v_ArrVal_4576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4576))) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4533))) (exists ((v_ArrVal_4549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4571) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4545))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4546))) (exists ((v_ArrVal_4567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4562))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4535))) (exists ((v_ArrVal_4560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4560))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (_ bv72 32) (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4563))) (exists ((v_ArrVal_4534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4534) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4548))) (exists ((v_ArrVal_4539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4539))) (exists ((v_ArrVal_4504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4504) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4572))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4573))) (exists ((v_ArrVal_4564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4564))) (exists ((v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4507))) (exists ((v_ArrVal_4536 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4536) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4537))) (exists ((v_ArrVal_4551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4551))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518))) (exists ((v_ArrVal_4555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4555))) (exists ((v_ArrVal_4547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4547))) (exists ((v_ArrVal_4565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4565) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056))) (exists ((v_ArrVal_4577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4554))) (exists ((v_ArrVal_4544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4544))) (exists ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4532))) (exists ((v_ArrVal_4505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4505))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4570))) (exists ((v_ArrVal_4538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4506)))) is different from true [2022-11-16 11:18:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:20,707 INFO L93 Difference]: Finished difference Result 2611 states and 2813 transitions. [2022-11-16 11:18:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:18:20,711 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 3.627450980392157) internal successors, (185), 54 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-11-16 11:18:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:20,715 INFO L225 Difference]: With dead ends: 2611 [2022-11-16 11:18:20,716 INFO L226 Difference]: Without dead ends: 2611 [2022-11-16 11:18:20,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 125 SyntacticMatches, 55 SemanticMatches, 74 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=243, Invalid=873, Unknown=112, NotChecked=4472, Total=5700 [2022-11-16 11:18:20,719 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 2750 mSDsluCounter, 7648 mSDsCounter, 0 mSdLazyCounter, 10036 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2768 SdHoareTripleChecker+Valid, 8494 SdHoareTripleChecker+Invalid, 71833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61754 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:20,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2768 Valid, 8494 Invalid, 71833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 10036 Invalid, 0 Unknown, 61754 Unchecked, 24.8s Time] [2022-11-16 11:18:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-11-16 11:18:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1789. [2022-11-16 11:18:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1093 states have (on average 1.7731015553522416) internal successors, (1938), 1778 states have internal predecessors, (1938), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:18:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 1962 transitions. [2022-11-16 11:18:20,752 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 1962 transitions. Word has length 113 [2022-11-16 11:18:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:20,753 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 1962 transitions. [2022-11-16 11:18:20,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 3.627450980392157) internal successors, (185), 54 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:18:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 1962 transitions. [2022-11-16 11:18:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:18:20,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:20,755 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:18:20,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:20,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:21,169 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-16 11:18:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -729759675, now seen corresponding path program 1 times [2022-11-16 11:18:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:21,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918118096] [2022-11-16 11:18:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:21,171 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:21,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-16 11:18:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:22,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-16 11:18:22,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:22,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:18:22,568 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:18:22,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:18:22,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:18:22,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-16 11:18:23,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5519)))) is different from true [2022-11-16 11:18:23,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_68) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:18:24,838 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:18:24,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:18:24,976 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:18:24,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:18:25,103 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:18:25,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:18:25,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-16 11:18:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-16 11:18:25,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:18:25,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5561) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-16 11:18:25,279 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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_5561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 11:18:25,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (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~mem35#1.base| v_ArrVal_5560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:18:25,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (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_5560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-16 11:18:25,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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~mem33#1.base| v_ArrVal_5607))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5560)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:18:25,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:25,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918118096] [2022-11-16 11:18:25,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918118096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:18:25,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1959382916] [2022-11-16 11:18:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:25,658 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:18:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:18:25,659 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:18:25,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c247b1-6c3e-44b2-b19b-e02bc159de68/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-16 11:18:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:53,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-16 11:18:53,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:53,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:18:53,477 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:18:53,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 11:18:53,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:18:53,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:18:53,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-16 11:18:53,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:18:54,181 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992)))) is different from true [2022-11-16 11:18:54,623 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998)))) is different from true [2022-11-16 11:18:54,728 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (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)))) is different from true [2022-11-16 11:18:55,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006)))) is different from true [2022-11-16 11:18:55,514 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010)))) is different from true [2022-11-16 11:18:55,895 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6015) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:18:56,614 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024)))) is different from true [2022-11-16 11:18:57,258 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_10|)))) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032)))) is different from true [2022-11-16 11:18:57,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:18:57,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:57,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2022-11-16 11:18:57,775 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-16 11:18:57,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2022-11-16 11:18:57,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 11:18:57,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:57,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:57,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:57,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:57,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-16 11:18:58,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 11:18:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-16 11:18:58,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:19:01,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117414 treesize of output 79056