./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8 --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 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- 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-2329fc7 [2022-12-13 15:09:48,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:09:48,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:09:48,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:09:48,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:09:48,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:09:48,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:09:48,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:09:48,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:09:48,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:09:48,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:09:48,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:09:48,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:09:48,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:09:48,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:09:48,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:09:48,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:09:48,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:09:48,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:09:48,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:09:48,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:09:48,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:09:48,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:09:48,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:09:48,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:09:48,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:09:48,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:09:48,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:09:48,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:09:48,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:09:48,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:09:48,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:09:48,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:09:48,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:09:48,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:09:48,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:09:48,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:09:48,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:09:48,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:09:48,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:09:48,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:09:48,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:09:48,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:09:48,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:09:48,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:09:48,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:09:48,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:09:48,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:09:48,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:09:48,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:09:48,263 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:09:48,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:09:48,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:09:48,263 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:09:48,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:09:48,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:09:48,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:09:48,264 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:09:48,264 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:09:48,265 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:09:48,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:09:48,265 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:09:48,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:09:48,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:09:48,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:09:48,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:09:48,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:09:48,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:09:48,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:09:48,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:09:48,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:09:48,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:09:48,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:09:48,267 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:09:48,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:09:48,267 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:09:48,268 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8 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 -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2022-12-13 15:09:48,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:09:48,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:09:48,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:09:48,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:09:48,466 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:09:48,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-13 15:09:51,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:09:51,284 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:09:51,284 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-13 15:09:51,303 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data/adfe582b3/bd0436d68235435f83ea77fe3b1cb7ae/FLAG194b3dd13 [2022-12-13 15:09:51,619 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data/adfe582b3/bd0436d68235435f83ea77fe3b1cb7ae [2022-12-13 15:09:51,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:09:51,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:09:51,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:09:51,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:09:51,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:09:51,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:09:51" (1/1) ... [2022-12-13 15:09:51,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b523cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:51, skipping insertion in model container [2022-12-13 15:09:51,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:09:51" (1/1) ... [2022-12-13 15:09:51,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:09:51,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:09:51,987 WARN L237 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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-13 15:09:52,085 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:52,096 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:52,107 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:52,124 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:52,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:09:52,146 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-12-13 15:09:52,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65218317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:52, skipping insertion in model container [2022-12-13 15:09:52,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:09:52,147 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 15:09:52,149 INFO L158 Benchmark]: Toolchain (without parser) took 522.89ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 89.5MB in the beginning and 140.1MB in the end (delta: -50.7MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-12-13 15:09:52,149 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:09:52,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.55ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 89.5MB in the beginning and 140.1MB in the end (delta: -50.7MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-12-13 15:09:52,151 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.11ms. Allocated memory is still 127.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.55ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 89.5MB in the beginning and 140.1MB in the end (delta: -50.7MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types 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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8 --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 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- 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-2329fc7 [2022-12-13 15:09:53,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:09:53,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:09:53,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:09:53,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:09:53,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:09:53,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:09:53,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:09:53,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:09:53,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:09:53,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:09:53,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:09:53,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:09:53,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:09:53,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:09:53,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:09:53,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:09:53,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:09:53,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:09:53,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:09:53,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:09:53,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:09:53,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:09:53,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:09:53,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:09:53,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:09:53,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:09:53,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:09:53,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:09:53,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:09:53,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:09:53,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:09:53,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:09:53,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:09:53,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:09:53,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:09:53,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:09:53,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:09:53,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:09:53,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:09:53,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:09:53,578 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:09:53,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:09:53,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:09:53,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:09:53,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:09:53,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:09:53,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:09:53,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:09:53,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:09:53,605 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:09:53,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:09:53,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:09:53,606 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:09:53,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:09:53,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:09:53,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:09:53,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:09:53,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:09:53,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:09:53,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:09:53,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:09:53,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:09:53,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:09:53,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:09:53,609 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8 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 -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2022-12-13 15:09:53,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:09:53,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:09:53,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:09:53,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:09:53,859 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:09:53,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-13 15:09:56,463 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:09:56,716 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:09:56,717 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-13 15:09:56,731 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data/a9593efea/f729bded5b5641d397e46e38a582323a/FLAGf397a4279 [2022-12-13 15:09:56,742 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/data/a9593efea/f729bded5b5641d397e46e38a582323a [2022-12-13 15:09:56,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:09:56,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:09:56,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:09:56,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:09:56,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:09:56,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:09:56" (1/1) ... [2022-12-13 15:09:56,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7521fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:56, skipping insertion in model container [2022-12-13 15:09:56,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:09:56" (1/1) ... [2022-12-13 15:09:56,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:09:56,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:09:57,092 WARN L237 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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-13 15:09:57,171 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,181 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,192 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,203 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:09:57,219 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 15:09:57,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:09:57,244 WARN L237 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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-13 15:09:57,306 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,314 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,321 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,328 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:09:57,335 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:09:57,351 WARN L237 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_d459bad3-0719-4fa7-8f03-ba4023ec6c75/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-13 15:09:57,378 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,383 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,388 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,393 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:09:57,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:09:57,421 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:09:57,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57 WrapperNode [2022-12-13 15:09:57,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:09:57,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:09:57,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:09:57,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:09:57,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,516 INFO L138 Inliner]: procedures = 180, calls = 524, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2176 [2022-12-13 15:09:57,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:09:57,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:09:57,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:09:57,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:09:57,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:09:57,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:09:57,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:09:57,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:09:57,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (1/1) ... [2022-12-13 15:09:57,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:09:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:09:57,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:09:57,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:09:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 15:09:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-12-13 15:09:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-12-13 15:09:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 15:09:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 15:09:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 15:09:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 15:09:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 15:09:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 15:09:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:09:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:09:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:09:57,850 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:09:57,851 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:09:57,854 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 15:10:04,351 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:10:04,363 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:10:04,363 INFO L300 CfgBuilder]: Removed 151 assume(true) statements. [2022-12-13 15:10:04,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:10:04 BoogieIcfgContainer [2022-12-13 15:10:04,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:10:04,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:10:04,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:10:04,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:10:04,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:09:56" (1/3) ... [2022-12-13 15:10:04,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1918ae3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:10:04, skipping insertion in model container [2022-12-13 15:10:04,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:09:57" (2/3) ... [2022-12-13 15:10:04,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1918ae3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:10:04, skipping insertion in model container [2022-12-13 15:10:04,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:10:04" (3/3) ... [2022-12-13 15:10:04,372 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2022-12-13 15:10:04,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:10:04,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 990 error locations. [2022-12-13 15:10:04,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:10:04,462 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@527d43b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:10:04,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 990 error locations. [2022-12-13 15:10:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 2058 states, 1056 states have (on average 2.2045454545454546) internal successors, (2328), 2044 states have internal predecessors, (2328), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 15:10:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 15:10:04,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:04,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 15:10:04,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-12-13 15:10:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:04,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890433252] [2022-12-13 15:10:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:04,485 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-12-13 15:10:04,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:04,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:04,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:04,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:10:04,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:04,698 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-12-13 15:10:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:04,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:04,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:04,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890433252] [2022-12-13 15:10:04,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890433252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:04,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:04,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:10:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993956850] [2022-12-13 15:10:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:04,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:04,752 INFO L87 Difference]: Start difference. First operand has 2058 states, 1056 states have (on average 2.2045454545454546) internal successors, (2328), 2044 states have internal predecessors, (2328), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:07,769 INFO L93 Difference]: Finished difference Result 2555 states and 2718 transitions. [2022-12-13 15:10:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:07,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 15:10:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:07,792 INFO L225 Difference]: With dead ends: 2555 [2022-12-13 15:10:07,792 INFO L226 Difference]: Without dead ends: 2553 [2022-12-13 15:10:07,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:07,796 INFO L413 NwaCegarLoop]: 1269 mSDtfsCounter, 1947 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:07,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 1640 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-12-13 15:10:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2022-12-13 15:10:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2200. [2022-12-13 15:10:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1222 states have (on average 2.037643207855974) internal successors, (2490), 2184 states have internal predecessors, (2490), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 15:10:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2522 transitions. [2022-12-13 15:10:07,884 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2522 transitions. Word has length 3 [2022-12-13 15:10:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:07,884 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 2522 transitions. [2022-12-13 15:10:07,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2522 transitions. [2022-12-13 15:10:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 15:10:07,885 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:07,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 15:10:07,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:08,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:08,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-12-13 15:10:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:08,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421725960] [2022-12-13 15:10:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:08,087 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-12-13 15:10:08,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:08,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:08,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:08,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:10:08,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:08,187 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-12-13 15:10:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:08,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:08,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421725960] [2022-12-13 15:10:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421725960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:08,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:08,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:10:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854064045] [2022-12-13 15:10:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:08,198 INFO L87 Difference]: Start difference. First operand 2200 states and 2522 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:12,945 INFO L93 Difference]: Finished difference Result 2971 states and 3374 transitions. [2022-12-13 15:10:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:12,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 15:10:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:12,953 INFO L225 Difference]: With dead ends: 2971 [2022-12-13 15:10:12,953 INFO L226 Difference]: Without dead ends: 2971 [2022-12-13 15:10:12,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:12,954 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 844 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:12,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 3009 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-12-13 15:10:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2022-12-13 15:10:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2649. [2022-12-13 15:10:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 1669 states have (on average 1.9970041941282204) internal successors, (3333), 2630 states have internal predecessors, (3333), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 15:10:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3371 transitions. [2022-12-13 15:10:12,992 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3371 transitions. Word has length 3 [2022-12-13 15:10:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:12,992 INFO L495 AbstractCegarLoop]: Abstraction has 2649 states and 3371 transitions. [2022-12-13 15:10:12,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3371 transitions. [2022-12-13 15:10:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 15:10:12,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:12,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:10:13,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 15:10:13,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:13,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-12-13 15:10:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:13,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556177344] [2022-12-13 15:10:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:13,195 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-12-13 15:10:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:13,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:13,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:13,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:10:13,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:13,337 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-12-13 15:10:13,343 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-12-13 15:10:13,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:10:13,401 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-12-13 15:10:13,417 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:10:13,417 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-12-13 15:10:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:13,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:13,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:13,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556177344] [2022-12-13 15:10:13,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556177344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:13,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:13,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921264292] [2022-12-13 15:10:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:13,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:13,439 INFO L87 Difference]: Start difference. First operand 2649 states and 3371 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:21,305 INFO L93 Difference]: Finished difference Result 4902 states and 5774 transitions. [2022-12-13 15:10:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 15:10:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:21,316 INFO L225 Difference]: With dead ends: 4902 [2022-12-13 15:10:21,316 INFO L226 Difference]: Without dead ends: 4902 [2022-12-13 15:10:21,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:21,317 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 4299 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:21,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4309 Valid, 2059 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-12-13 15:10:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-12-13 15:10:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 3366. [2022-12-13 15:10:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 2386 states have (on average 2.0352053646269908) internal successors, (4856), 3341 states have internal predecessors, (4856), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4906 transitions. [2022-12-13 15:10:21,399 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4906 transitions. Word has length 7 [2022-12-13 15:10:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:21,400 INFO L495 AbstractCegarLoop]: Abstraction has 3366 states and 4906 transitions. [2022-12-13 15:10:21,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4906 transitions. [2022-12-13 15:10:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 15:10:21,400 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:21,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:10:21,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 15:10:21,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:21,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-12-13 15:10:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420512220] [2022-12-13 15:10:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:21,607 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-12-13 15:10:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:21,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:21,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:21,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:10:21,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:21,728 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-12-13 15:10:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:21,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:21,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:21,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420512220] [2022-12-13 15:10:21,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420512220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:21,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:21,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:10:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743292154] [2022-12-13 15:10:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:21,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:21,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:21,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:21,739 INFO L87 Difference]: Start difference. First operand 3366 states and 4906 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:24,837 INFO L93 Difference]: Finished difference Result 4570 states and 6423 transitions. [2022-12-13 15:10:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 15:10:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:24,845 INFO L225 Difference]: With dead ends: 4570 [2022-12-13 15:10:24,845 INFO L226 Difference]: Without dead ends: 4570 [2022-12-13 15:10:24,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:24,846 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 1994 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:24,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 2617 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 15:10:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2022-12-13 15:10:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3275. [2022-12-13 15:10:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2386 states have (on average 1.9459346186085498) internal successors, (4643), 3250 states have internal predecessors, (4643), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4693 transitions. [2022-12-13 15:10:24,899 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4693 transitions. Word has length 8 [2022-12-13 15:10:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:24,900 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 4693 transitions. [2022-12-13 15:10:24,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4693 transitions. [2022-12-13 15:10:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 15:10:24,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:24,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:10:24,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 15:10:25,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:25,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-12-13 15:10:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:25,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472530622] [2022-12-13 15:10:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:25,102 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-12-13 15:10:25,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:25,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:25,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:25,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:10:25,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:25,215 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-12-13 15:10:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:25,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:25,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:25,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472530622] [2022-12-13 15:10:25,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472530622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:25,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:10:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079026654] [2022-12-13 15:10:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:25,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:25,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:25,232 INFO L87 Difference]: Start difference. First operand 3275 states and 4693 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:30,026 INFO L93 Difference]: Finished difference Result 4992 states and 7052 transitions. [2022-12-13 15:10:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:30,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 15:10:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:30,035 INFO L225 Difference]: With dead ends: 4992 [2022-12-13 15:10:30,035 INFO L226 Difference]: Without dead ends: 4992 [2022-12-13 15:10:30,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:30,036 INFO L413 NwaCegarLoop]: 2343 mSDtfsCounter, 1371 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:30,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 3327 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-12-13 15:10:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2022-12-13 15:10:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3597. [2022-12-13 15:10:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 2718 states have (on average 1.9334069168506254) internal successors, (5255), 3572 states have internal predecessors, (5255), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5305 transitions. [2022-12-13 15:10:30,080 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5305 transitions. Word has length 8 [2022-12-13 15:10:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:30,080 INFO L495 AbstractCegarLoop]: Abstraction has 3597 states and 5305 transitions. [2022-12-13 15:10:30,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5305 transitions. [2022-12-13 15:10:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 15:10:30,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:30,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:10:30,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 15:10:30,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-12-13 15:10:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:30,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899503405] [2022-12-13 15:10:30,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:30,284 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-12-13 15:10:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:30,285 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:30,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:10:30,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:30,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:30,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899503405] [2022-12-13 15:10:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899503405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:30,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:30,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851807384] [2022-12-13 15:10:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:30,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:30,492 INFO L87 Difference]: Start difference. First operand 3597 states and 5305 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-12-13 15:10:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:30,530 INFO L93 Difference]: Finished difference Result 3537 states and 5219 transitions. [2022-12-13 15:10:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:30,531 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-12-13 15:10:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:30,539 INFO L225 Difference]: With dead ends: 3537 [2022-12-13 15:10:30,539 INFO L226 Difference]: Without dead ends: 3537 [2022-12-13 15:10:30,539 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-12-13 15:10:30,540 INFO L413 NwaCegarLoop]: 2007 mSDtfsCounter, 801 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3219 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-12-13 15:10:30,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3219 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:10:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-12-13 15:10:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3537. [2022-12-13 15:10:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 2682 states have (on average 1.9272930648769575) internal successors, (5169), 3512 states have internal predecessors, (5169), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 5219 transitions. [2022-12-13 15:10:30,579 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 5219 transitions. Word has length 11 [2022-12-13 15:10:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:30,579 INFO L495 AbstractCegarLoop]: Abstraction has 3537 states and 5219 transitions. [2022-12-13 15:10:30,579 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-12-13 15:10:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 5219 transitions. [2022-12-13 15:10:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 15:10:30,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:30,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:10:30,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-12-13 15:10:30,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:30,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150864352] [2022-12-13 15:10:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:30,785 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-12-13 15:10:30,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:30,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:30,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:10:30,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:30,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:30,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:30,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150864352] [2022-12-13 15:10:30,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150864352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:30,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:30,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:10:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069439103] [2022-12-13 15:10:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:30,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:30,947 INFO L87 Difference]: Start difference. First operand 3537 states and 5219 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-12-13 15:10:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:31,028 INFO L93 Difference]: Finished difference Result 3509 states and 5163 transitions. [2022-12-13 15:10:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:31,029 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-12-13 15:10:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:31,034 INFO L225 Difference]: With dead ends: 3509 [2022-12-13 15:10:31,035 INFO L226 Difference]: Without dead ends: 3509 [2022-12-13 15:10:31,035 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-12-13 15:10:31,035 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 782 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 5129 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:31,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 5129 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:10:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2022-12-13 15:10:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3507. [2022-12-13 15:10:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 2666 states have (on average 1.9171042760690173) internal successors, (5111), 3482 states have internal predecessors, (5111), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 5161 transitions. [2022-12-13 15:10:31,072 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 5161 transitions. Word has length 13 [2022-12-13 15:10:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:31,072 INFO L495 AbstractCegarLoop]: Abstraction has 3507 states and 5161 transitions. [2022-12-13 15:10:31,072 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-12-13 15:10:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 5161 transitions. [2022-12-13 15:10:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 15:10:31,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:31,072 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] [2022-12-13 15:10:31,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 15:10:31,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:31,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-12-13 15:10:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:31,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073798877] [2022-12-13 15:10:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:31,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:10:31,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:31,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:31,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:31,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:10:31,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:31,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:31,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:31,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073798877] [2022-12-13 15:10:31,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073798877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:31,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:31,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581929058] [2022-12-13 15:10:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:31,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:31,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:31,521 INFO L87 Difference]: Start difference. First operand 3507 states and 5161 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:31,561 INFO L93 Difference]: Finished difference Result 4755 states and 6516 transitions. [2022-12-13 15:10:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:31,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 15:10:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:31,575 INFO L225 Difference]: With dead ends: 4755 [2022-12-13 15:10:31,575 INFO L226 Difference]: Without dead ends: 4755 [2022-12-13 15:10:31,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:31,576 INFO L413 NwaCegarLoop]: 3293 mSDtfsCounter, 1888 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 4697 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-12-13 15:10:31,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 4697 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:10:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2022-12-13 15:10:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3447. [2022-12-13 15:10:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2630 states have (on average 1.9106463878326996) internal successors, (5025), 3422 states have internal predecessors, (5025), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 5075 transitions. [2022-12-13 15:10:31,630 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 5075 transitions. Word has length 20 [2022-12-13 15:10:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:31,630 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 5075 transitions. [2022-12-13 15:10:31,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 5075 transitions. [2022-12-13 15:10:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 15:10:31,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:31,631 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] [2022-12-13 15:10:31,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 15:10:31,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:31,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-12-13 15:10:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:31,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720442943] [2022-12-13 15:10:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:31,833 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-12-13 15:10:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:31,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:31,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:31,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:10:31,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:31,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:31,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720442943] [2022-12-13 15:10:31,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720442943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:31,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:31,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503229555] [2022-12-13 15:10:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:10:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:10:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:31,989 INFO L87 Difference]: Start difference. First operand 3447 states and 5075 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:32,051 INFO L93 Difference]: Finished difference Result 4588 states and 6225 transitions. [2022-12-13 15:10:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:10:32,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 15:10:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:32,063 INFO L225 Difference]: With dead ends: 4588 [2022-12-13 15:10:32,063 INFO L226 Difference]: Without dead ends: 4588 [2022-12-13 15:10:32,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:10:32,069 INFO L413 NwaCegarLoop]: 3202 mSDtfsCounter, 1845 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 4558 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-12-13 15:10:32,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 4558 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:10:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2022-12-13 15:10:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 3315. [2022-12-13 15:10:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 2522 states have (on average 1.8901665344964313) internal successors, (4767), 3290 states have internal predecessors, (4767), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4817 transitions. [2022-12-13 15:10:32,118 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 4817 transitions. Word has length 20 [2022-12-13 15:10:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:32,119 INFO L495 AbstractCegarLoop]: Abstraction has 3315 states and 4817 transitions. [2022-12-13 15:10:32,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4817 transitions. [2022-12-13 15:10:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 15:10:32,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:32,120 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] [2022-12-13 15:10:32,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:32,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:32,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-12-13 15:10:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:32,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340914871] [2022-12-13 15:10:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:32,325 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-12-13 15:10:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:32,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:32,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:32,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:10:32,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:32,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:32,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:32,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340914871] [2022-12-13 15:10:32,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340914871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:32,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:32,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:10:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676269528] [2022-12-13 15:10:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:32,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:32,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:32,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:32,580 INFO L87 Difference]: Start difference. First operand 3315 states and 4817 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:32,665 INFO L93 Difference]: Finished difference Result 4553 states and 6159 transitions. [2022-12-13 15:10:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:32,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 15:10:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:32,672 INFO L225 Difference]: With dead ends: 4553 [2022-12-13 15:10:32,673 INFO L226 Difference]: Without dead ends: 4553 [2022-12-13 15:10:32,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:10:32,673 INFO L413 NwaCegarLoop]: 3162 mSDtfsCounter, 1826 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 7678 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:32,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 7678 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:10:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2022-12-13 15:10:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 3285. [2022-12-13 15:10:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 2506 states have (on average 1.8790901835594573) internal successors, (4709), 3260 states have internal predecessors, (4709), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4759 transitions. [2022-12-13 15:10:32,730 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4759 transitions. Word has length 22 [2022-12-13 15:10:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:32,730 INFO L495 AbstractCegarLoop]: Abstraction has 3285 states and 4759 transitions. [2022-12-13 15:10:32,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4759 transitions. [2022-12-13 15:10:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 15:10:32,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:32,732 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] [2022-12-13 15:10:32,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 15:10:32,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:32,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-12-13 15:10:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:32,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479962489] [2022-12-13 15:10:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:32,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:10:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:32,935 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:32,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:33,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:10:33,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:33,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:33,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:33,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479962489] [2022-12-13 15:10:33,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479962489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:33,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:33,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:10:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834259543] [2022-12-13 15:10:33,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:33,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:33,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:33,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:33,107 INFO L87 Difference]: Start difference. First operand 3285 states and 4759 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:33,181 INFO L93 Difference]: Finished difference Result 4480 states and 5970 transitions. [2022-12-13 15:10:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 15:10:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:33,188 INFO L225 Difference]: With dead ends: 4480 [2022-12-13 15:10:33,188 INFO L226 Difference]: Without dead ends: 4480 [2022-12-13 15:10:33,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:10:33,188 INFO L413 NwaCegarLoop]: 3087 mSDtfsCounter, 1791 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 7488 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:33,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 7488 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:10:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2022-12-13 15:10:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3223. [2022-12-13 15:10:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2458 states have (on average 1.8449959316517495) internal successors, (4535), 3198 states have internal predecessors, (4535), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4585 transitions. [2022-12-13 15:10:33,227 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4585 transitions. Word has length 22 [2022-12-13 15:10:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:33,227 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 4585 transitions. [2022-12-13 15:10:33,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4585 transitions. [2022-12-13 15:10:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:10:33,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:33,228 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-12-13 15:10:33,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 15:10:33,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:33,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-12-13 15:10:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:33,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668861780] [2022-12-13 15:10:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:33,429 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-12-13 15:10:33,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:33,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:33,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:33,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:10:33,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:33,538 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-12-13 15:10:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:33,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:33,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668861780] [2022-12-13 15:10:33,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668861780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:33,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:33,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746793615] [2022-12-13 15:10:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:33,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:33,580 INFO L87 Difference]: Start difference. First operand 3223 states and 4585 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:36,588 INFO L93 Difference]: Finished difference Result 3497 states and 4756 transitions. [2022-12-13 15:10:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:36,589 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-12-13 15:10:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:36,592 INFO L225 Difference]: With dead ends: 3497 [2022-12-13 15:10:36,592 INFO L226 Difference]: Without dead ends: 3497 [2022-12-13 15:10:36,592 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-12-13 15:10:36,592 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 2359 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:36,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 2007 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 15:10:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2022-12-13 15:10:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3219. [2022-12-13 15:10:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2458 states have (on average 1.8417412530512611) internal successors, (4527), 3194 states have internal predecessors, (4527), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4577 transitions. [2022-12-13 15:10:36,618 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4577 transitions. Word has length 27 [2022-12-13 15:10:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:36,619 INFO L495 AbstractCegarLoop]: Abstraction has 3219 states and 4577 transitions. [2022-12-13 15:10:36,619 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-12-13 15:10:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4577 transitions. [2022-12-13 15:10:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:10:36,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:36,619 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-12-13 15:10:36,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 15:10:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:36,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-12-13 15:10:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:36,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612262548] [2022-12-13 15:10:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:36,823 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-12-13 15:10:36,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:36,826 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:36,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:37,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:10:37,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:37,013 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-12-13 15:10:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:37,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:37,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:37,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612262548] [2022-12-13 15:10:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612262548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:37,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:37,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053286169] [2022-12-13 15:10:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:37,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:37,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:37,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:37,116 INFO L87 Difference]: Start difference. First operand 3219 states and 4577 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-12-13 15:10:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:41,910 INFO L93 Difference]: Finished difference Result 3921 states and 5351 transitions. [2022-12-13 15:10:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:10:41,911 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-12-13 15:10:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:41,914 INFO L225 Difference]: With dead ends: 3921 [2022-12-13 15:10:41,914 INFO L226 Difference]: Without dead ends: 3921 [2022-12-13 15:10:41,914 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-12-13 15:10:41,914 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 1488 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:41,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 3463 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-12-13 15:10:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2022-12-13 15:10:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3255. [2022-12-13 15:10:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 2494 states have (on average 1.8315958299919808) internal successors, (4568), 3230 states have internal predecessors, (4568), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4618 transitions. [2022-12-13 15:10:41,942 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4618 transitions. Word has length 27 [2022-12-13 15:10:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:41,942 INFO L495 AbstractCegarLoop]: Abstraction has 3255 states and 4618 transitions. [2022-12-13 15:10:41,942 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-12-13 15:10:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4618 transitions. [2022-12-13 15:10:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 15:10:41,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:41,943 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] [2022-12-13 15:10:41,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:42,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:42,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:42,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-12-13 15:10:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765650049] [2022-12-13 15:10:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:42,147 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-12-13 15:10:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:42,150 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:42,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:42,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:10:42,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:42,476 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-12-13 15:10:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:42,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:42,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:42,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765650049] [2022-12-13 15:10:42,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765650049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:42,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:42,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845994661] [2022-12-13 15:10:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:42,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:42,529 INFO L87 Difference]: Start difference. First operand 3255 states and 4618 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:46,935 INFO L93 Difference]: Finished difference Result 6298 states and 8778 transitions. [2022-12-13 15:10:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 15:10:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:46,941 INFO L225 Difference]: With dead ends: 6298 [2022-12-13 15:10:46,941 INFO L226 Difference]: Without dead ends: 6298 [2022-12-13 15:10:46,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:10:46,941 INFO L413 NwaCegarLoop]: 2131 mSDtfsCounter, 3914 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:46,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3921 Valid, 3965 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-13 15:10:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2022-12-13 15:10:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 3251. [2022-12-13 15:10:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2494 states have (on average 1.8283881315156376) internal successors, (4560), 3226 states have internal predecessors, (4560), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4610 transitions. [2022-12-13 15:10:46,984 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4610 transitions. Word has length 36 [2022-12-13 15:10:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:46,984 INFO L495 AbstractCegarLoop]: Abstraction has 3251 states and 4610 transitions. [2022-12-13 15:10:46,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4610 transitions. [2022-12-13 15:10:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 15:10:46,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:46,985 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] [2022-12-13 15:10:46,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 15:10:47,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:47,186 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-12-13 15:10:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:47,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103830954] [2022-12-13 15:10:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:47,190 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-12-13 15:10:47,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:47,192 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:47,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:47,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:10:47,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:47,525 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-12-13 15:10:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:47,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:47,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:47,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103830954] [2022-12-13 15:10:47,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103830954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:47,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:47,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:47,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450218982] [2022-12-13 15:10:47,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:47,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:47,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:47,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:47,646 INFO L87 Difference]: Start difference. First operand 3251 states and 4610 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:54,296 INFO L93 Difference]: Finished difference Result 5969 states and 8158 transitions. [2022-12-13 15:10:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:10:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 15:10:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:54,301 INFO L225 Difference]: With dead ends: 5969 [2022-12-13 15:10:54,301 INFO L226 Difference]: Without dead ends: 5969 [2022-12-13 15:10:54,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:10:54,301 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 2437 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 4872 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:54,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 4872 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-12-13 15:10:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2022-12-13 15:10:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3247. [2022-12-13 15:10:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2494 states have (on average 1.8251804330392942) internal successors, (4552), 3222 states have internal predecessors, (4552), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:10:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 4602 transitions. [2022-12-13 15:10:54,330 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 4602 transitions. Word has length 36 [2022-12-13 15:10:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:10:54,330 INFO L495 AbstractCegarLoop]: Abstraction has 3247 states and 4602 transitions. [2022-12-13 15:10:54,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 4602 transitions. [2022-12-13 15:10:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 15:10:54,330 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:10:54,331 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] [2022-12-13 15:10:54,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 15:10:54,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:54,531 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:10:54,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:54,531 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-12-13 15:10:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:10:54,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330428028] [2022-12-13 15:10:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:54,532 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-12-13 15:10:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:10:54,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:54,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:10:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:54,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:10:54,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:54,690 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-12-13 15:10:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:10:54,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:10:54,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:10:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330428028] [2022-12-13 15:10:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330428028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:10:54,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:10:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:10:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172429201] [2022-12-13 15:10:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:10:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:10:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:10:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:10:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:10:54,750 INFO L87 Difference]: Start difference. First operand 3247 states and 4602 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:10:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:59,981 INFO L93 Difference]: Finished difference Result 6741 states and 9288 transitions. [2022-12-13 15:10:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:10:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 15:10:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:10:59,988 INFO L225 Difference]: With dead ends: 6741 [2022-12-13 15:10:59,988 INFO L226 Difference]: Without dead ends: 6741 [2022-12-13 15:10:59,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:10:59,988 INFO L413 NwaCegarLoop]: 1959 mSDtfsCounter, 4484 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:10:59,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 3980 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-13 15:10:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2022-12-13 15:11:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 3244. [2022-12-13 15:11:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2494 states have (on average 1.8163592622293505) internal successors, (4530), 3219 states have internal predecessors, (4530), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:11:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4580 transitions. [2022-12-13 15:11:00,023 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4580 transitions. Word has length 36 [2022-12-13 15:11:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:00,023 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4580 transitions. [2022-12-13 15:11:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4580 transitions. [2022-12-13 15:11:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 15:11:00,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:00,023 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] [2022-12-13 15:11:00,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:00,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:00,224 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-12-13 15:11:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188541042] [2022-12-13 15:11:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:00,224 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-12-13 15:11:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:00,225 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:00,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:00,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:11:00,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:00,393 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-12-13 15:11:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:00,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:00,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188541042] [2022-12-13 15:11:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188541042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:00,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:00,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:11:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63503833] [2022-12-13 15:11:00,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:00,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:00,518 INFO L87 Difference]: Start difference. First operand 3244 states and 4580 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:06,058 INFO L93 Difference]: Finished difference Result 4803 states and 6543 transitions. [2022-12-13 15:11:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 15:11:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:06,062 INFO L225 Difference]: With dead ends: 4803 [2022-12-13 15:11:06,062 INFO L226 Difference]: Without dead ends: 4803 [2022-12-13 15:11:06,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:06,062 INFO L413 NwaCegarLoop]: 2234 mSDtfsCounter, 2208 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 4091 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:06,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 4091 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-12-13 15:11:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2022-12-13 15:11:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 3244. [2022-12-13 15:11:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2494 states have (on average 1.8131515637530071) internal successors, (4522), 3219 states have internal predecessors, (4522), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:11:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4572 transitions. [2022-12-13 15:11:06,090 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4572 transitions. Word has length 36 [2022-12-13 15:11:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:06,090 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4572 transitions. [2022-12-13 15:11:06,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4572 transitions. [2022-12-13 15:11:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 15:11:06,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:06,090 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] [2022-12-13 15:11:06,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-12-13 15:11:06,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:06,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-12-13 15:11:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:06,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415496800] [2022-12-13 15:11:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:06,294 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-12-13 15:11:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:06,297 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:06,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:06,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:11:06,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:06,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:06,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415496800] [2022-12-13 15:11:06,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415496800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:06,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:06,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690197453] [2022-12-13 15:11:06,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:06,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:06,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:06,500 INFO L87 Difference]: Start difference. First operand 3244 states and 4572 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:06,541 INFO L93 Difference]: Finished difference Result 3232 states and 4548 transitions. [2022-12-13 15:11:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:06,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-12-13 15:11:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:06,543 INFO L225 Difference]: With dead ends: 3232 [2022-12-13 15:11:06,543 INFO L226 Difference]: Without dead ends: 3232 [2022-12-13 15:11:06,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:06,544 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 759 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4610 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-12-13 15:11:06,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4610 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:11:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-12-13 15:11:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3232. [2022-12-13 15:11:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2482 states have (on average 1.8122481869460112) internal successors, (4498), 3207 states have internal predecessors, (4498), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-13 15:11:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4548 transitions. [2022-12-13 15:11:06,569 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4548 transitions. Word has length 40 [2022-12-13 15:11:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:06,569 INFO L495 AbstractCegarLoop]: Abstraction has 3232 states and 4548 transitions. [2022-12-13 15:11:06,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4548 transitions. [2022-12-13 15:11:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 15:11:06,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:06,570 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] [2022-12-13 15:11:06,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-13 15:11:06,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:06,770 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-12-13 15:11:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:06,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458842574] [2022-12-13 15:11:06,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:06,771 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-12-13 15:11:06,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:06,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:06,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:06,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:11:06,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:07,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:07,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:07,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458842574] [2022-12-13 15:11:07,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458842574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:07,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:07,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:11:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451694346] [2022-12-13 15:11:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:07,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:11:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:11:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:11:07,069 INFO L87 Difference]: Start difference. First operand 3232 states and 4548 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:07,248 INFO L93 Difference]: Finished difference Result 4679 states and 6365 transitions. [2022-12-13 15:11:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:11:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-12-13 15:11:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:07,258 INFO L225 Difference]: With dead ends: 4679 [2022-12-13 15:11:07,259 INFO L226 Difference]: Without dead ends: 4679 [2022-12-13 15:11:07,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:11:07,259 INFO L413 NwaCegarLoop]: 1813 mSDtfsCounter, 1178 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:07,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3491 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:11:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-12-13 15:11:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4015. [2022-12-13 15:11:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 3261 states have (on average 1.7985280588776449) internal successors, (5865), 3983 states have internal predecessors, (5865), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 15:11:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5929 transitions. [2022-12-13 15:11:07,288 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5929 transitions. Word has length 48 [2022-12-13 15:11:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:07,288 INFO L495 AbstractCegarLoop]: Abstraction has 4015 states and 5929 transitions. [2022-12-13 15:11:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5929 transitions. [2022-12-13 15:11:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 15:11:07,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:07,289 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] [2022-12-13 15:11:07,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-12-13 15:11:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:07,490 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-12-13 15:11:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:07,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957677767] [2022-12-13 15:11:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:07,494 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-12-13 15:11:07,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:07,496 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:07,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-13 15:11:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:07,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:11:07,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:07,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:07,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:07,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957677767] [2022-12-13 15:11:07,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957677767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:07,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:07,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388467956] [2022-12-13 15:11:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:07,776 INFO L87 Difference]: Start difference. First operand 4015 states and 5929 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:07,833 INFO L93 Difference]: Finished difference Result 4953 states and 6910 transitions. [2022-12-13 15:11:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:07,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-13 15:11:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:07,837 INFO L225 Difference]: With dead ends: 4953 [2022-12-13 15:11:07,837 INFO L226 Difference]: Without dead ends: 4953 [2022-12-13 15:11:07,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:07,837 INFO L413 NwaCegarLoop]: 2861 mSDtfsCounter, 1754 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 6812 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-12-13 15:11:07,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 6812 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:11:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2022-12-13 15:11:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 3973. [2022-12-13 15:11:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3973 states, 3219 states have (on average 1.8002485243864554) internal successors, (5795), 3941 states have internal predecessors, (5795), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 15:11:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5859 transitions. [2022-12-13 15:11:07,877 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5859 transitions. Word has length 51 [2022-12-13 15:11:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:07,877 INFO L495 AbstractCegarLoop]: Abstraction has 3973 states and 5859 transitions. [2022-12-13 15:11:07,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5859 transitions. [2022-12-13 15:11:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 15:11:07,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:07,878 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] [2022-12-13 15:11:07,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-13 15:11:08,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:08,079 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-12-13 15:11:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:08,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135842793] [2022-12-13 15:11:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:08,082 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-12-13 15:11:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:08,085 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:08,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:11:08,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:08,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:08,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:08,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135842793] [2022-12-13 15:11:08,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135842793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:08,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:08,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225486587] [2022-12-13 15:11:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:08,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:08,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:08,369 INFO L87 Difference]: Start difference. First operand 3973 states and 5859 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:08,428 INFO L93 Difference]: Finished difference Result 4690 states and 6398 transitions. [2022-12-13 15:11:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:08,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-12-13 15:11:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:08,432 INFO L225 Difference]: With dead ends: 4690 [2022-12-13 15:11:08,432 INFO L226 Difference]: Without dead ends: 4690 [2022-12-13 15:11:08,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:08,432 INFO L413 NwaCegarLoop]: 2901 mSDtfsCounter, 1745 mSDsluCounter, 4040 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 6941 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-12-13 15:11:08,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 6941 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:11:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2022-12-13 15:11:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 3955. [2022-12-13 15:11:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 3201 states have (on average 1.8009996875976257) internal successors, (5765), 3923 states have internal predecessors, (5765), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 15:11:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5829 transitions. [2022-12-13 15:11:08,463 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5829 transitions. Word has length 54 [2022-12-13 15:11:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:08,463 INFO L495 AbstractCegarLoop]: Abstraction has 3955 states and 5829 transitions. [2022-12-13 15:11:08,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5829 transitions. [2022-12-13 15:11:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 15:11:08,464 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:08,464 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] [2022-12-13 15:11:08,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:08,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:08,665 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1488707999, now seen corresponding path program 1 times [2022-12-13 15:11:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624295211] [2022-12-13 15:11:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:08,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:11:08,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:08,671 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:08,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-13 15:11:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:08,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:11:08,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:08,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:11:08,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:11:08,904 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 29 treesize of output 38 [2022-12-13 15:11:08,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:11:08,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-12-13 15:11:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:08,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:08,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:08,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624295211] [2022-12-13 15:11:08,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624295211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:08,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:08,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:08,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634721945] [2022-12-13 15:11:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:08,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:08,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:08,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:08,967 INFO L87 Difference]: Start difference. First operand 3955 states and 5829 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:10,823 INFO L93 Difference]: Finished difference Result 3924 states and 5797 transitions. [2022-12-13 15:11:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-13 15:11:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:10,827 INFO L225 Difference]: With dead ends: 3924 [2022-12-13 15:11:10,828 INFO L226 Difference]: Without dead ends: 3924 [2022-12-13 15:11:10,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:10,828 INFO L413 NwaCegarLoop]: 1689 mSDtfsCounter, 762 mSDsluCounter, 2555 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:10,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 4244 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 15:11:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2022-12-13 15:11:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3921. [2022-12-13 15:11:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3167 states have (on average 1.8092832333438584) internal successors, (5730), 3889 states have internal predecessors, (5730), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 15:11:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 5794 transitions. [2022-12-13 15:11:10,870 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 5794 transitions. Word has length 57 [2022-12-13 15:11:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:10,870 INFO L495 AbstractCegarLoop]: Abstraction has 3921 states and 5794 transitions. [2022-12-13 15:11:10,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 5794 transitions. [2022-12-13 15:11:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 15:11:10,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:10,871 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] [2022-12-13 15:11:10,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-12-13 15:11:11,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:11,072 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-12-13 15:11:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233605911] [2022-12-13 15:11:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:11,074 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-12-13 15:11:11,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:11,075 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:11,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:11,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:11:11,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:11,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:11,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:11,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233605911] [2022-12-13 15:11:11,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233605911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:11,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:11,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:11:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618984684] [2022-12-13 15:11:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:11,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:11:11,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:11,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:11:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:11:11,430 INFO L87 Difference]: Start difference. First operand 3921 states and 5794 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:11,613 INFO L93 Difference]: Finished difference Result 5180 states and 7386 transitions. [2022-12-13 15:11:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:11:11,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-13 15:11:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:11,620 INFO L225 Difference]: With dead ends: 5180 [2022-12-13 15:11:11,620 INFO L226 Difference]: Without dead ends: 5180 [2022-12-13 15:11:11,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:11:11,621 INFO L413 NwaCegarLoop]: 1807 mSDtfsCounter, 868 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:11,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 3475 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:11:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2022-12-13 15:11:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 4837. [2022-12-13 15:11:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4837 states, 4077 states have (on average 1.7888153053715967) internal successors, (7293), 4796 states have internal predecessors, (7293), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 15:11:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 7375 transitions. [2022-12-13 15:11:11,685 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 7375 transitions. Word has length 59 [2022-12-13 15:11:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:11,685 INFO L495 AbstractCegarLoop]: Abstraction has 4837 states and 7375 transitions. [2022-12-13 15:11:11,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 7375 transitions. [2022-12-13 15:11:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 15:11:11,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:11,686 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] [2022-12-13 15:11:11,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 15:11:11,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:11,888 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-12-13 15:11:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:11,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102232670] [2022-12-13 15:11:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:11,891 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-12-13 15:11:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:11,894 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:11,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-12-13 15:11:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:12,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:11:12,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:12,259 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-12-13 15:11:12,263 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-12-13 15:11:12,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:11:12,560 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-12-13 15:11:12,570 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:11:12,571 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-12-13 15:11:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:12,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:12,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:12,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102232670] [2022-12-13 15:11:12,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102232670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:12,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:12,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:11:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196835979] [2022-12-13 15:11:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:12,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:12,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:12,582 INFO L87 Difference]: Start difference. First operand 4837 states and 7375 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:16,854 INFO L93 Difference]: Finished difference Result 6868 states and 10388 transitions. [2022-12-13 15:11:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-13 15:11:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:16,861 INFO L225 Difference]: With dead ends: 6868 [2022-12-13 15:11:16,861 INFO L226 Difference]: Without dead ends: 6868 [2022-12-13 15:11:16,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:16,861 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 2422 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:16,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 1071 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-12-13 15:11:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-12-13 15:11:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 4597. [2022-12-13 15:11:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 3921 states have (on average 1.7118082121907676) internal successors, (6712), 4556 states have internal predecessors, (6712), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 15:11:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 6794 transitions. [2022-12-13 15:11:16,914 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 6794 transitions. Word has length 62 [2022-12-13 15:11:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:16,915 INFO L495 AbstractCegarLoop]: Abstraction has 4597 states and 6794 transitions. [2022-12-13 15:11:16,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 6794 transitions. [2022-12-13 15:11:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:11:16,915 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:16,916 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-12-13 15:11:16,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-12-13 15:11:17,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:17,117 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-12-13 15:11:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:17,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380867557] [2022-12-13 15:11:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:17,120 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-12-13 15:11:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:17,123 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:17,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:17,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:11:17,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:17,405 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-12-13 15:11:17,414 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-12-13 15:11:17,436 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-12-13 15:11:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:17,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:17,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:17,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380867557] [2022-12-13 15:11:17,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380867557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:17,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:17,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728803597] [2022-12-13 15:11:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:17,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:11:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:11:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:17,446 INFO L87 Difference]: Start difference. First operand 4597 states and 6794 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:20,984 INFO L93 Difference]: Finished difference Result 4596 states and 6791 transitions. [2022-12-13 15:11:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:11:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-13 15:11:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:20,988 INFO L225 Difference]: With dead ends: 4596 [2022-12-13 15:11:20,988 INFO L226 Difference]: Without dead ends: 4596 [2022-12-13 15:11:20,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:11:20,988 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 4 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:20,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4573 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 15:11:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-12-13 15:11:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-12-13 15:11:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3921 states have (on average 1.7110431012496812) internal successors, (6709), 4555 states have internal predecessors, (6709), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 15:11:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6791 transitions. [2022-12-13 15:11:21,029 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6791 transitions. Word has length 67 [2022-12-13 15:11:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:21,030 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 6791 transitions. [2022-12-13 15:11:21,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6791 transitions. [2022-12-13 15:11:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:11:21,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:21,031 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-12-13 15:11:21,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-12-13 15:11:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:21,232 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-12-13 15:11:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:21,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794084237] [2022-12-13 15:11:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:21,236 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-12-13 15:11:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:21,239 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:21,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-12-13 15:11:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:21,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 15:11:21,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:21,512 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-12-13 15:11:21,523 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-12-13 15:11:21,528 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-12-13 15:11:21,558 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-12-13 15:11:21,563 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-12-13 15:11:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:21,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:21,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:21,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794084237] [2022-12-13 15:11:21,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794084237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:21,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:21,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245868096] [2022-12-13 15:11:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:21,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:11:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:11:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:21,575 INFO L87 Difference]: Start difference. First operand 4596 states and 6791 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:26,953 INFO L93 Difference]: Finished difference Result 4595 states and 6788 transitions. [2022-12-13 15:11:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:11:26,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-13 15:11:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:26,956 INFO L225 Difference]: With dead ends: 4595 [2022-12-13 15:11:26,956 INFO L226 Difference]: Without dead ends: 4595 [2022-12-13 15:11:26,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:11:26,957 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 2 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:26,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4546 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-12-13 15:11:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-12-13 15:11:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2022-12-13 15:11:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4595 states, 3918 states have (on average 1.7115875446656457) internal successors, (6706), 4554 states have internal predecessors, (6706), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 15:11:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 6788 transitions. [2022-12-13 15:11:27,001 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 6788 transitions. Word has length 67 [2022-12-13 15:11:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:27,001 INFO L495 AbstractCegarLoop]: Abstraction has 4595 states and 6788 transitions. [2022-12-13 15:11:27,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 6788 transitions. [2022-12-13 15:11:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:11:27,002 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:27,002 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-12-13 15:11:27,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-12-13 15:11:27,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:27,203 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-12-13 15:11:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:27,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153170198] [2022-12-13 15:11:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:27,208 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-12-13 15:11:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:27,211 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:27,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:27,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:11:27,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:27,708 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-12-13 15:11:27,716 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-12-13 15:11:27,736 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-12-13 15:11:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:27,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:27,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153170198] [2022-12-13 15:11:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153170198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:27,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633167354] [2022-12-13 15:11:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:11:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:11:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:27,746 INFO L87 Difference]: Start difference. First operand 4595 states and 6788 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:31,252 INFO L93 Difference]: Finished difference Result 4594 states and 6784 transitions. [2022-12-13 15:11:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:11:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-13 15:11:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:31,256 INFO L225 Difference]: With dead ends: 4594 [2022-12-13 15:11:31,256 INFO L226 Difference]: Without dead ends: 4594 [2022-12-13 15:11:31,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:11:31,256 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 4 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:31,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4568 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 15:11:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2022-12-13 15:11:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4594. [2022-12-13 15:11:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4594 states, 3918 states have (on average 1.7105666156202144) internal successors, (6702), 4553 states have internal predecessors, (6702), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 15:11:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 6784 transitions. [2022-12-13 15:11:31,287 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 6784 transitions. Word has length 67 [2022-12-13 15:11:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:31,287 INFO L495 AbstractCegarLoop]: Abstraction has 4594 states and 6784 transitions. [2022-12-13 15:11:31,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 6784 transitions. [2022-12-13 15:11:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:11:31,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:31,288 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-12-13 15:11:31,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-12-13 15:11:31,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:31,489 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:31,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-12-13 15:11:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:31,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289781171] [2022-12-13 15:11:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:31,492 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-12-13 15:11:31,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:31,495 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:31,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-12-13 15:11:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:31,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 15:11:31,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:31,781 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-12-13 15:11:31,795 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-12-13 15:11:31,801 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-12-13 15:11:31,838 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-12-13 15:11:31,842 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-12-13 15:11:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:31,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:31,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:31,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289781171] [2022-12-13 15:11:31,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289781171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:31,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:31,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127720486] [2022-12-13 15:11:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:31,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:11:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:11:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:31,855 INFO L87 Difference]: Start difference. First operand 4594 states and 6784 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:36,746 INFO L93 Difference]: Finished difference Result 4593 states and 6780 transitions. [2022-12-13 15:11:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:11:36,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-13 15:11:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:36,750 INFO L225 Difference]: With dead ends: 4593 [2022-12-13 15:11:36,750 INFO L226 Difference]: Without dead ends: 4593 [2022-12-13 15:11:36,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:11:36,750 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 2 mSDsluCounter, 2831 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:36,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4541 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-12-13 15:11:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-12-13 15:11:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4593. [2022-12-13 15:11:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 3914 states have (on average 1.7112927950945325) internal successors, (6698), 4552 states have internal predecessors, (6698), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 15:11:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6780 transitions. [2022-12-13 15:11:36,782 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6780 transitions. Word has length 67 [2022-12-13 15:11:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:36,782 INFO L495 AbstractCegarLoop]: Abstraction has 4593 states and 6780 transitions. [2022-12-13 15:11:36,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:11:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6780 transitions. [2022-12-13 15:11:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 15:11:36,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:36,783 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:11:36,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-12-13 15:11:36,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:36,984 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2018345425, now seen corresponding path program 1 times [2022-12-13 15:11:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:36,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850236857] [2022-12-13 15:11:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:36,988 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-12-13 15:11:36,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:36,990 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:36,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-12-13 15:11:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:37,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:11:37,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:37,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:11:37,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850236857] [2022-12-13 15:11:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850236857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:11:37,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:11:37,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:11:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504198775] [2022-12-13 15:11:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:11:37,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:11:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:11:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:11:37,315 INFO L87 Difference]: Start difference. First operand 4593 states and 6780 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:11:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:37,366 INFO L93 Difference]: Finished difference Result 4596 states and 6789 transitions. [2022-12-13 15:11:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:11:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-12-13 15:11:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:37,373 INFO L225 Difference]: With dead ends: 4596 [2022-12-13 15:11:37,373 INFO L226 Difference]: Without dead ends: 4596 [2022-12-13 15:11:37,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:11:37,374 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 2 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5119 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-12-13 15:11:37,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:11:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-12-13 15:11:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-12-13 15:11:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3916 states have (on average 1.7111848825331972) internal successors, (6701), 4555 states have internal predecessors, (6701), 41 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:11:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6789 transitions. [2022-12-13 15:11:37,413 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6789 transitions. Word has length 75 [2022-12-13 15:11:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:37,414 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 6789 transitions. [2022-12-13 15:11:37,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:11:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6789 transitions. [2022-12-13 15:11:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 15:11:37,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:37,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:11:37,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-12-13 15:11:37,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:37,615 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1265252366, now seen corresponding path program 1 times [2022-12-13 15:11:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:37,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868089365] [2022-12-13 15:11:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:11:37,618 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-12-13 15:11:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:37,621 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:37,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-12-13 15:11:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:11:37,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:11:37,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:37,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:11:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:38,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:38,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868089365] [2022-12-13 15:11:38,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868089365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:11:38,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:11:38,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-13 15:11:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378520014] [2022-12-13 15:11:38,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:11:38,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:11:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:11:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:11:38,024 INFO L87 Difference]: Start difference. First operand 4596 states and 6789 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:38,182 INFO L93 Difference]: Finished difference Result 4608 states and 6811 transitions. [2022-12-13 15:11:38,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:11:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-12-13 15:11:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:38,188 INFO L225 Difference]: With dead ends: 4608 [2022-12-13 15:11:38,188 INFO L226 Difference]: Without dead ends: 4608 [2022-12-13 15:11:38,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:11:38,189 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 9 mSDsluCounter, 5110 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6819 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:38,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6819 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:11:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2022-12-13 15:11:38,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4606. [2022-12-13 15:11:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4606 states, 3925 states have (on average 1.7110828025477707) internal successors, (6716), 4564 states have internal predecessors, (6716), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:11:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 6804 transitions. [2022-12-13 15:11:38,226 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 6804 transitions. Word has length 76 [2022-12-13 15:11:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:38,226 INFO L495 AbstractCegarLoop]: Abstraction has 4606 states and 6804 transitions. [2022-12-13 15:11:38,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 6804 transitions. [2022-12-13 15:11:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 15:11:38,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:38,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:11:38,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-12-13 15:11:38,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:38,428 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1799258641, now seen corresponding path program 2 times [2022-12-13 15:11:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:38,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665141120] [2022-12-13 15:11:38,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:11:38,429 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-12-13 15:11:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:38,429 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:38,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-12-13 15:11:38,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:11:38,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:11:38,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:11:38,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:38,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:11:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:39,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665141120] [2022-12-13 15:11:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665141120] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:11:39,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:11:39,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-12-13 15:11:39,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123305882] [2022-12-13 15:11:39,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:11:39,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 15:11:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 15:11:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:11:39,114 INFO L87 Difference]: Start difference. First operand 4606 states and 6804 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:39,804 INFO L93 Difference]: Finished difference Result 4627 states and 6852 transitions. [2022-12-13 15:11:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 15:11:39,805 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2022-12-13 15:11:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:39,810 INFO L225 Difference]: With dead ends: 4627 [2022-12-13 15:11:39,810 INFO L226 Difference]: Without dead ends: 4623 [2022-12-13 15:11:39,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-12-13 15:11:39,810 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 23 mSDsluCounter, 10240 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11952 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:39,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11952 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:11:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2022-12-13 15:11:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4615. [2022-12-13 15:11:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 3934 states have (on average 1.7102186070157601) internal successors, (6728), 4573 states have internal predecessors, (6728), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:11:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6816 transitions. [2022-12-13 15:11:39,843 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6816 transitions. Word has length 79 [2022-12-13 15:11:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:39,843 INFO L495 AbstractCegarLoop]: Abstraction has 4615 states and 6816 transitions. [2022-12-13 15:11:39,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6816 transitions. [2022-12-13 15:11:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 15:11:39,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:39,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:11:39,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-12-13 15:11:40,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:40,045 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:40,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1875379825, now seen corresponding path program 3 times [2022-12-13 15:11:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205870983] [2022-12-13 15:11:40,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:11:40,049 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-12-13 15:11:40,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:40,052 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:40,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-12-13 15:11:40,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 15:11:40,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:11:40,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 15:11:40,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:41,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:11:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:41,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205870983] [2022-12-13 15:11:41,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205870983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:11:41,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:11:41,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-12-13 15:11:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441619656] [2022-12-13 15:11:41,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:11:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 15:11:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 15:11:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-12-13 15:11:41,678 INFO L87 Difference]: Start difference. First operand 4615 states and 6816 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:45,153 INFO L93 Difference]: Finished difference Result 4657 states and 6953 transitions. [2022-12-13 15:11:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 15:11:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2022-12-13 15:11:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:45,159 INFO L225 Difference]: With dead ends: 4657 [2022-12-13 15:11:45,159 INFO L226 Difference]: Without dead ends: 4651 [2022-12-13 15:11:45,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 15:11:45,160 INFO L413 NwaCegarLoop]: 1716 mSDtfsCounter, 51 mSDsluCounter, 18820 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 20536 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:45,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 20536 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 15:11:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2022-12-13 15:11:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4633. [2022-12-13 15:11:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4633 states, 3952 states have (on average 1.708248987854251) internal successors, (6751), 4591 states have internal predecessors, (6751), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:11:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 6839 transitions. [2022-12-13 15:11:45,201 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 6839 transitions. Word has length 85 [2022-12-13 15:11:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:45,202 INFO L495 AbstractCegarLoop]: Abstraction has 4633 states and 6839 transitions. [2022-12-13 15:11:45,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 6839 transitions. [2022-12-13 15:11:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 15:11:45,202 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:45,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:11:45,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-12-13 15:11:45,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:45,403 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -905623345, now seen corresponding path program 4 times [2022-12-13 15:11:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:45,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867280957] [2022-12-13 15:11:45,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:11:45,407 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-12-13 15:11:45,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:45,410 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:45,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-12-13 15:11:45,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:11:45,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:11:45,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 15:11:45,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:46,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:11:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:11:47,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:11:47,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867280957] [2022-12-13 15:11:47,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867280957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:11:47,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:11:47,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-12-13 15:11:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301987307] [2022-12-13 15:11:47,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:11:47,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 15:11:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:11:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 15:11:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 15:11:47,591 INFO L87 Difference]: Start difference. First operand 4633 states and 6839 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:11:57,301 INFO L93 Difference]: Finished difference Result 4713 states and 7056 transitions. [2022-12-13 15:11:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-12-13 15:11:57,302 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2022-12-13 15:11:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:11:57,311 INFO L225 Difference]: With dead ends: 4713 [2022-12-13 15:11:57,311 INFO L226 Difference]: Without dead ends: 4709 [2022-12-13 15:11:57,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-12-13 15:11:57,314 INFO L413 NwaCegarLoop]: 1729 mSDtfsCounter, 86 mSDsluCounter, 39657 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 41386 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:11:57,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 41386 Invalid, 3121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [123 Valid, 2998 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 15:11:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2022-12-13 15:11:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4667. [2022-12-13 15:11:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3986 states have (on average 1.705218263923733) internal successors, (6797), 4625 states have internal predecessors, (6797), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:11:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 6885 transitions. [2022-12-13 15:11:57,403 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 6885 transitions. Word has length 97 [2022-12-13 15:11:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:11:57,404 INFO L495 AbstractCegarLoop]: Abstraction has 4667 states and 6885 transitions. [2022-12-13 15:11:57,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 15:11:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 6885 transitions. [2022-12-13 15:11:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 15:11:57,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:11:57,405 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, 1, 1, 1] [2022-12-13 15:11:57,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-12-13 15:11:57,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:57,605 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:11:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:11:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 616848239, now seen corresponding path program 5 times [2022-12-13 15:11:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:11:57,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204679611] [2022-12-13 15:11:57,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:11:57,607 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-12-13 15:11:57,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:11:57,608 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:11:57,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-12-13 15:11:58,891 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 15:11:58,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:11:58,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 15:11:58,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:11:58,938 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-12-13 15:11:59,039 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:11:59,039 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-12-13 15:11:59,070 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-12-13 15:11:59,158 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-12-13 15:11:59,252 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2624)))) is different from true [2022-12-13 15:11:59,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2645) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:12:00,057 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2655) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:12:00,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2661 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2661) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:12:00,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:12:00,359 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-12-13 15:12:00,398 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-12-13 15:12:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-12-13 15:12:00,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:12:00,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 15:12:00,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:12:00,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204679611] [2022-12-13 15:12:00,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204679611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:12:00,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562884229] [2022-12-13 15:12:00,661 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:12:00,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:12:00,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:12:00,662 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:12:00,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-12-13 15:13:05,228 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-12-13 15:13:05,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:13:05,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 15:13:05,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:13:05,471 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-12-13 15:13:05,557 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:13:05,557 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-12-13 15:13:05,568 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-12-13 15:13:05,607 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-12-13 15:13:05,789 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (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)))) is different from true [2022-12-13 15:13:06,357 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116)))) is different from true [2022-12-13 15:13:06,416 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3119)))) is different from true [2022-12-13 15:13:06,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3128)))) is different from true [2022-12-13 15:13:06,676 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:13:06,676 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-12-13 15:13:06,713 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-12-13 15:13:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-12-13 15:13:06,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:13:06,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3175) |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-12-13 15:13:06,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1562884229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:13:06,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:13:06,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2022-12-13 15:13:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543742195] [2022-12-13 15:13:06,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:13:06,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 15:13:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:13:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 15:13:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=87, Unknown=17, NotChecked=270, Total=420 [2022-12-13 15:13:06,909 INFO L87 Difference]: Start difference. First operand 4667 states and 6885 transitions. Second operand has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 17 states have internal predecessors, (91), 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-12-13 15:13:08,232 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (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_2645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2645) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_2661 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2661) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2624))) (exists ((v_ArrVal_2655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2655) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3119))) (exists ((v_ArrVal_2623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2623))) (exists ((v_ArrVal_3128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3128)))) is different from true [2022-12-13 15:13:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:13:20,379 INFO L93 Difference]: Finished difference Result 6834 states and 10231 transitions. [2022-12-13 15:13:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:13:20,379 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 17 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-12-13 15:13:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:13:20,391 INFO L225 Difference]: With dead ends: 6834 [2022-12-13 15:13:20,391 INFO L226 Difference]: Without dead ends: 6830 [2022-12-13 15:13:20,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 143 SyntacticMatches, 82 SemanticMatches, 23 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=138, Unknown=21, NotChecked=374, Total=600 [2022-12-13 15:13:20,392 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 1581 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 11 mSolverCounterUnsat, 1348 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 5257 SdHoareTripleChecker+Invalid, 19784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 1348 IncrementalHoareTripleChecker+Unknown, 13821 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:13:20,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 5257 Invalid, 19784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4604 Invalid, 1348 Unknown, 13821 Unchecked, 13.2s Time] [2022-12-13 15:13:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2022-12-13 15:13:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 4715. [2022-12-13 15:13:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4715 states, 4034 states have (on average 1.696331184928111) internal successors, (6843), 4672 states have internal predecessors, (6843), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:13:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 6931 transitions. [2022-12-13 15:13:20,446 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 6931 transitions. Word has length 119 [2022-12-13 15:13:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:13:20,447 INFO L495 AbstractCegarLoop]: Abstraction has 4715 states and 6931 transitions. [2022-12-13 15:13:20,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 17 states have internal predecessors, (91), 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-12-13 15:13:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 6931 transitions. [2022-12-13 15:13:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 15:13:20,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:13:20,447 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, 1, 1, 1] [2022-12-13 15:13:20,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-12-13 15:13:20,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-12-13 15:13:20,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 15:13:20,848 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:13:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:13:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash 616848240, now seen corresponding path program 1 times [2022-12-13 15:13:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:13:20,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817775285] [2022-12-13 15:13:20,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:20,849 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-12-13 15:13:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:13:20,850 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:13:20,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-12-13 15:13:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:13:21,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-13 15:13:21,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:13:21,524 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-12-13 15:13:21,621 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:13:21,621 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-12-13 15:13:21,627 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-12-13 15:13:21,644 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-12-13 15:13:21,652 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-12-13 15:13:21,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 22 treesize of output 10 [2022-12-13 15:13:21,751 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-12-13 15:13:21,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:13:21,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:13:21,820 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:13:21,830 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557)))) is different from true [2022-12-13 15:13:21,872 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-12-13 15:13:21,934 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:13:21,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569)))) is different from true [2022-12-13 15:13:21,951 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:13:21,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574)))) is different from true [2022-12-13 15:13:21,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576)))) is different from true [2022-12-13 15:13:21,986 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:13:21,996 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:13:22,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:13:22,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-12-13 15:13:22,165 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598)))) is different from true [2022-12-13 15:13:22,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:13:22,233 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605))) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2022-12-13 15:13:22,288 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612)))) is different from true [2022-12-13 15:13:22,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2022-12-13 15:13:22,376 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-12-13 15:13:22,385 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623)))) is different from true [2022-12-13 15:13:22,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626)))) is different from true [2022-12-13 15:13:22,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627)))) is different from true [2022-12-13 15:13:22,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3629) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3630 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3630)))) is different from true [2022-12-13 15:13:22,417 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632)))) is different from true [2022-12-13 15:13:22,449 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-12-13 15:13:22,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638)))) is different from true [2022-12-13 15:13:22,485 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:13:22,485 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-12-13 15:13:22,490 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-12-13 15:13:22,527 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-12-13 15:13:22,532 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-12-13 15:13:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-12-13 15:13:22,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:13:23,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 15:13:23,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:13:23,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817775285] [2022-12-13 15:13:23,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817775285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:13:23,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1085940729] [2022-12-13 15:13:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:13:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:13:23,337 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:13:23,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-12-13 15:15:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:15:11,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 110 conjunts are in the unsatisfiable core [2022-12-13 15:15:12,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:15:12,004 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-12-13 15:15:12,092 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:15:12,092 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-12-13 15:15:12,097 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-12-13 15:15:12,109 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-12-13 15:15:12,118 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-12-13 15:15:12,163 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-12-13 15:15:12,167 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-12-13 15:15:12,204 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-12-13 15:15:12,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112)))) is different from true [2022-12-13 15:15:12,306 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:15:12,337 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:15:12,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4126))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4127) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:15:12,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133)))) is different from true [2022-12-13 15:15:12,437 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:15:12,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:15:12,527 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145)))) is different from true [2022-12-13 15:15:12,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146)))) is different from true [2022-12-13 15:15:12,546 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-12-13 15:15:12,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151)))) is different from true [2022-12-13 15:15:12,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153)))) is different from true [2022-12-13 15:15:12,599 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156)))) is different from true [2022-12-13 15:15:12,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161)))) is different from true [2022-12-13 15:15:12,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:15:12,700 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168)))) is different from true [2022-12-13 15:15:12,709 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171)))) is different from true [2022-12-13 15:15:12,792 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:15:12,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181)))) is different from true [2022-12-13 15:15:12,810 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-12-13 15:15:12,819 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184)))) is different from true [2022-12-13 15:15:12,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186)))) is different from true [2022-12-13 15:15:12,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:15:12,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-12-13 15:15:12,857 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193)))) is different from true [2022-12-13 15:15:12,889 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:15:12,889 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-12-13 15:15:12,894 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-12-13 15:15:12,934 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-12-13 15:15:12,940 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-12-13 15:15:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-12-13 15:15:12,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:15:13,552 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-13 15:15:13,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1085940729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:15:13,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:15:13,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 61 [2022-12-13 15:15:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800585377] [2022-12-13 15:15:13,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:15:13,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-13 15:15:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:15:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-13 15:15:13,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=134, Unknown=63, NotChecked=3960, Total=4290 [2022-12-13 15:15:13,559 INFO L87 Difference]: Start difference. First operand 4715 states and 6931 transitions. Second operand has 62 states, 60 states have (on average 2.5) internal successors, (150), 62 states have internal predecessors, (150), 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-12-13 15:15:14,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:15:14,899 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638)))) is different from true [2022-12-13 15:15:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:15:29,886 INFO L93 Difference]: Finished difference Result 6829 states and 10222 transitions. [2022-12-13 15:15:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:15:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 2.5) internal successors, (150), 62 states have internal predecessors, (150), 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 119 [2022-12-13 15:15:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:15:29,894 INFO L225 Difference]: With dead ends: 6829 [2022-12-13 15:15:29,894 INFO L226 Difference]: Without dead ends: 6829 [2022-12-13 15:15:29,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 143 SyntacticMatches, 39 SemanticMatches, 72 ConstructedPredicates, 57 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=254, Unknown=71, NotChecked=4902, Total=5402 [2022-12-13 15:15:29,895 INFO L413 NwaCegarLoop]: 968 mSDtfsCounter, 1583 mSDsluCounter, 3886 mSDsCounter, 0 mSdLazyCounter, 7453 mSolverCounterSat, 13 mSolverCounterUnsat, 1014 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 4854 SdHoareTripleChecker+Invalid, 143405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 7453 IncrementalHoareTripleChecker+Invalid, 1014 IncrementalHoareTripleChecker+Unknown, 134925 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:15:29,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1592 Valid, 4854 Invalid, 143405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 7453 Invalid, 1014 Unknown, 134925 Unchecked, 15.8s Time] [2022-12-13 15:15:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2022-12-13 15:15:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 4714. [2022-12-13 15:15:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 4034 states have (on average 1.6955875061973227) internal successors, (6840), 4671 states have internal predecessors, (6840), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-13 15:15:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 6928 transitions. [2022-12-13 15:15:29,942 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 6928 transitions. Word has length 119 [2022-12-13 15:15:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:15:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 4714 states and 6928 transitions. [2022-12-13 15:15:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 2.5) internal successors, (150), 62 states have internal predecessors, (150), 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-12-13 15:15:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 6928 transitions. [2022-12-13 15:15:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 15:15:29,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:15:29,943 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, 1, 1, 1] [2022-12-13 15:15:29,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-12-13 15:15:30,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-12-13 15:15:30,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 15:15:30,344 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:15:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:15:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash -462913067, now seen corresponding path program 1 times [2022-12-13 15:15:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:15:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000555492] [2022-12-13 15:15:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:15:30,345 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-12-13 15:15:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:15:30,346 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:15:30,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-12-13 15:15:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:15:30,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 15:15:30,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:15:30,985 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-12-13 15:15:30,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:15:30,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:15:30,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:15:30,995 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 30 treesize of output 39 [2022-12-13 15:15:31,060 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:15:31,060 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-12-13 15:15:31,123 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 45 treesize of output 41 [2022-12-13 15:15:31,203 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 45 treesize of output 41 [2022-12-13 15:15:31,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:15:31,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-12-13 15:15:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-12-13 15:15:31,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:15:31,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:15:31,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000555492] [2022-12-13 15:15:31,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000555492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:15:31,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:15:31,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:15:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106062534] [2022-12-13 15:15:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:15:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:15:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:15:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:15:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:15:31,276 INFO L87 Difference]: Start difference. First operand 4714 states and 6928 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:15:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:15:39,160 INFO L93 Difference]: Finished difference Result 4549 states and 6496 transitions. [2022-12-13 15:15:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:15:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-12-13 15:15:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:15:39,165 INFO L225 Difference]: With dead ends: 4549 [2022-12-13 15:15:39,165 INFO L226 Difference]: Without dead ends: 4549 [2022-12-13 15:15:39,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:15:39,165 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 1625 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 5168 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:15:39,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 5168 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-12-13 15:15:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2022-12-13 15:15:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4314. [2022-12-13 15:15:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 3635 states have (on average 1.71939477303989) internal successors, (6250), 4274 states have internal predecessors, (6250), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 15:15:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 6331 transitions. [2022-12-13 15:15:39,197 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 6331 transitions. Word has length 119 [2022-12-13 15:15:39,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:15:39,198 INFO L495 AbstractCegarLoop]: Abstraction has 4314 states and 6331 transitions. [2022-12-13 15:15:39,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:15:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 6331 transitions. [2022-12-13 15:15:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-13 15:15:39,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:15:39,198 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, 1, 1, 1, 1, 1, 1] [2022-12-13 15:15:39,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-12-13 15:15:39,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:15:39,399 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:15:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:15:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1638848775, now seen corresponding path program 1 times [2022-12-13 15:15:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:15:39,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778366360] [2022-12-13 15:15:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:15:39,400 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-12-13 15:15:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:15:39,400 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:15:39,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-12-13 15:15:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:15:40,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 15:15:40,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:15:40,164 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-12-13 15:15:40,248 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:15:40,248 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-12-13 15:15:40,268 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-12-13 15:15:40,344 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-12-13 15:15:40,632 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5051)))) is different from true [2022-12-13 15:15:40,813 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5059) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:15:41,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5068)))) is different from true [2022-12-13 15:15:41,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5071)))) is different from true [2022-12-13 15:15:41,213 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077)))) is different from true [2022-12-13 15:15:41,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5080)))) is different from true [2022-12-13 15:15:41,434 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:15:41,434 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-12-13 15:15:41,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:15:41,523 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-12-13 15:15:41,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 33 treesize of output 15 [2022-12-13 15:15:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-12-13 15:15:41,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:15:41,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5086) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 15:15:41,628 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 15:15:41,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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~mem39#1.base| v_ArrVal_5132))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 15:15:41,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:15:41,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778366360] [2022-12-13 15:15:41,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778366360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:15:41,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1313347807] [2022-12-13 15:15:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:15:41,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:15:41,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:15:41,831 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:15:41,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-12-13 15:15:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:15:45,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 15:15:45,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:15:45,251 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-12-13 15:15:45,339 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:15:45,340 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-12-13 15:15:45,352 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-12-13 15:15:45,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 24 treesize of output 12 [2022-12-13 15:15:45,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521)))) is different from true [2022-12-13 15:15:46,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:15:46,604 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-12-13 15:15:46,661 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:15:46,661 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-12-13 15:15:46,680 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-12-13 15:15:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 15:15:46,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:15:46,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5556) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 15:15:46,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (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_5556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 15:15:46,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5556)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 15:15:46,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1313347807] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:15:46,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:15:46,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2022-12-13 15:15:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075806703] [2022-12-13 15:15:46,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:15:46,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 15:15:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:15:46,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 15:15:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=105, Unknown=22, NotChecked=416, Total=600 [2022-12-13 15:15:46,923 INFO L87 Difference]: Start difference. First operand 4314 states and 6331 transitions. Second operand has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:15:47,745 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5080))) (exists ((v_ArrVal_5521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5521))) (exists ((v_ArrVal_5051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5051))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077))) (exists ((v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5068))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042))) (exists ((v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5071))) (exists ((v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5059) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:16:01,360 INFO L93 Difference]: Finished difference Result 6381 states and 9570 transitions. [2022-12-13 15:16:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 15:16:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-12-13 15:16:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:16:01,369 INFO L225 Difference]: With dead ends: 6381 [2022-12-13 15:16:01,369 INFO L226 Difference]: Without dead ends: 6381 [2022-12-13 15:16:01,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 150 SyntacticMatches, 83 SemanticMatches, 27 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=26, NotChecked=546, Total=812 [2022-12-13 15:16:01,370 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 1576 mSDsluCounter, 5133 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 12 mSolverCounterUnsat, 1523 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 6106 SdHoareTripleChecker+Invalid, 18744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 1523 IncrementalHoareTripleChecker+Unknown, 12093 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:16:01,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 6106 Invalid, 18744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5116 Invalid, 1523 Unknown, 12093 Unchecked, 14.2s Time] [2022-12-13 15:16:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2022-12-13 15:16:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 4313. [2022-12-13 15:16:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 3635 states have (on average 1.718569463548831) internal successors, (6247), 4273 states have internal predecessors, (6247), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 15:16:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6328 transitions. [2022-12-13 15:16:01,429 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6328 transitions. Word has length 122 [2022-12-13 15:16:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:16:01,429 INFO L495 AbstractCegarLoop]: Abstraction has 4313 states and 6328 transitions. [2022-12-13 15:16:01,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 15:16:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6328 transitions. [2022-12-13 15:16:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-13 15:16:01,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:16:01,431 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, 1, 1, 1, 1, 1, 1] [2022-12-13 15:16:01,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-12-13 15:16:01,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-12-13 15:16:01,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 15:16:01,832 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:16:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:16:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1638848774, now seen corresponding path program 1 times [2022-12-13 15:16:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:16:01,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230410671] [2022-12-13 15:16:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:01,836 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-12-13 15:16:01,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:16:01,839 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:16:01,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-12-13 15:16:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:16:02,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-13 15:16:02,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:16:02,677 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-12-13 15:16:02,751 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-12-13 15:16:02,760 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:16:02,760 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-12-13 15:16:02,773 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-12-13 15:16:02,779 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-12-13 15:16:02,848 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-12-13 15:16:02,851 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-12-13 15:16:02,896 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:16:02,904 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986))) (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987)))) is different from true [2022-12-13 15:16:02,948 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991)))) is different from true [2022-12-13 15:16:02,955 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-12-13 15:16:02,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995)))) is different from true [2022-12-13 15:16:02,993 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998)))) is different from true [2022-12-13 15:16:03,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (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-12-13 15:16:03,009 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:16:03,018 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-12-13 15:16:03,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (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))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007)))) is different from true [2022-12-13 15:16:03,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (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-12-13 15:16:03,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016)))) is different from true [2022-12-13 15:16:03,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022)))) is different from true [2022-12-13 15:16:03,178 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:16:03,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,193 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030)))) is different from true [2022-12-13 15:16:03,209 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (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-12-13 15:16:03,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,246 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039)))) is different from true [2022-12-13 15:16:03,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,261 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044)))) is different from true [2022-12-13 15:16:03,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:16:03,350 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054)))) is different from true [2022-12-13 15:16:03,359 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056)))) is different from true [2022-12-13 15:16:03,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058)))) is different from true [2022-12-13 15:16:03,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060)))) is different from true [2022-12-13 15:16:03,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2022-12-13 15:16:03,412 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067)))) is different from true [2022-12-13 15:16:03,420 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:16:03,467 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:16:03,468 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-12-13 15:16:03,473 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-12-13 15:16:03,574 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:16:03,575 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-12-13 15:16:03,585 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-12-13 15:16:03,603 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-12-13 15:16:03,609 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-12-13 15:16:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2022-12-13 15:16:03,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:16:03,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 15:16:03,804 WARN L837 $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_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 15:16:04,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165))) (let ((.cse2 (select (select .cse3 |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~mem39#1.base| v_ArrVal_6164) .cse2 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 15:16:04,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:16:04,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230410671] [2022-12-13 15:16:04,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230410671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:16:04,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [248521240] [2022-12-13 15:16:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:16:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:16:04,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:16:04,496 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:16:04,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-12-13 15:18:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:05,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-13 15:18:05,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:05,104 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-12-13 15:18:05,167 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-12-13 15:18:05,175 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:18:05,176 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-12-13 15:18:05,183 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-12-13 15:18:05,196 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-12-13 15:18:05,232 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-12-13 15:18:05,236 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-12-13 15:18:05,342 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554)))) is different from true [2022-12-13 15:18:05,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-12-13 15:18:05,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:05,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566)))) is different from true [2022-12-13 15:18:05,437 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:05,444 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569)))) is different from true [2022-12-13 15:18:05,477 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:05,507 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-12-13 15:18:05,610 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588)))) is different from true [2022-12-13 15:18:05,664 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:05,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:05,681 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-12-13 15:18:05,728 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-12-13 15:18:05,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:05,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609)))) is different from true [2022-12-13 15:18:05,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:05,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:05,826 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:05,857 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623)))) is different from true [2022-12-13 15:18:05,866 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626)))) is different from true [2022-12-13 15:18:05,918 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:05,926 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:05,959 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:18:05,959 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-12-13 15:18:05,965 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-12-13 15:18:06,025 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:18:06,025 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-12-13 15:18:06,036 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-12-13 15:18:06,058 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-12-13 15:18:06,064 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-12-13 15:18:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2022-12-13 15:18:06,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:18:06,114 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 15:18:06,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-13 15:18:06,708 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728))) (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~mem39#1.base| v_ArrVal_6727) .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-13 15:18:06,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [248521240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:06,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:18:06,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 31] total 63 [2022-12-13 15:18:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994968771] [2022-12-13 15:18:06,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:18:06,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-13 15:18:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:18:06,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-13 15:18:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=158, Unknown=67, NotChecked=4740, Total=5112 [2022-12-13 15:18:06,718 INFO L87 Difference]: Start difference. First operand 4313 states and 6328 transitions. Second operand has 64 states, 62 states have (on average 2.5) internal successors, (155), 64 states have internal predecessors, (155), 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-12-13 15:18:07,449 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:07,456 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986))) (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))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623))) (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:07,466 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:07,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:07,494 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_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))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:07,507 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060))) (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))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:07,521 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6024))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6025) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (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))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060))) (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))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623))) (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))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:07,525 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:22,352 INFO L93 Difference]: Finished difference Result 6380 states and 9567 transitions. [2022-12-13 15:18:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 15:18:22,353 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 2.5) internal successors, (155), 64 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 122 [2022-12-13 15:18:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:22,358 INFO L225 Difference]: With dead ends: 6380 [2022-12-13 15:18:22,358 INFO L226 Difference]: Without dead ends: 6380 [2022-12-13 15:18:22,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 150 SyntacticMatches, 36 SemanticMatches, 85 ConstructedPredicates, 68 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=324, Unknown=82, NotChecked=6868, Total=7482 [2022-12-13 15:18:22,359 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 1580 mSDsluCounter, 4850 mSDsCounter, 0 mSdLazyCounter, 8087 mSolverCounterSat, 13 mSolverCounterUnsat, 714 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 5822 SdHoareTripleChecker+Invalid, 101817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 8087 IncrementalHoareTripleChecker+Invalid, 714 IncrementalHoareTripleChecker+Unknown, 93003 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:22,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 5822 Invalid, 101817 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 8087 Invalid, 714 Unknown, 93003 Unchecked, 15.1s Time] [2022-12-13 15:18:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6380 states. [2022-12-13 15:18:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6380 to 4312. [2022-12-13 15:18:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3635 states have (on average 1.7177441540577716) internal successors, (6244), 4272 states have internal predecessors, (6244), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 15:18:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 6325 transitions. [2022-12-13 15:18:22,398 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 6325 transitions. Word has length 122 [2022-12-13 15:18:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:22,398 INFO L495 AbstractCegarLoop]: Abstraction has 4312 states and 6325 transitions. [2022-12-13 15:18:22,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 2.5) internal successors, (155), 64 states have internal predecessors, (155), 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-12-13 15:18:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 6325 transitions. [2022-12-13 15:18:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 15:18:22,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:22,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:22,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-12-13 15:18:22,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-12-13 15:18:22,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 15:18:22,801 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:18:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2050272681, now seen corresponding path program 1 times [2022-12-13 15:18:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:18:22,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433287464] [2022-12-13 15:18:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:22,805 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-12-13 15:18:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:18:22,806 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:18:22,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-12-13 15:18:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:23,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 15:18:23,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:23,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-12-13 15:18:23,913 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-12-13 15:18:23,924 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:18:23,924 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-12-13 15:18:23,945 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-12-13 15:18:23,954 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-12-13 15:18:24,043 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-12-13 15:18:24,047 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-12-13 15:18:24,095 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125)))) is different from true [2022-12-13 15:18:24,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7128) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7127)))) is different from true [2022-12-13 15:18:24,147 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131)))) is different from true [2022-12-13 15:18:24,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135)))) is different from true [2022-12-13 15:18:24,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138)))) is different from true [2022-12-13 15:18:24,196 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140)))) is different from true [2022-12-13 15:18:24,205 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141)))) is different from true [2022-12-13 15:18:24,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:24,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150)))) is different from true [2022-12-13 15:18:24,284 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:24,292 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:24,299 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156)))) is different from true [2022-12-13 15:18:24,328 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32)))) is different from true [2022-12-13 15:18:24,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161)))) is different from true [2022-12-13 15:18:24,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169)))) is different from true [2022-12-13 15:18:24,412 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172)))) is different from true [2022-12-13 15:18:24,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:18:24,445 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177)))) is different from true [2022-12-13 15:18:24,471 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182)))) is different from true [2022-12-13 15:18:24,499 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185)))) is different from true [2022-12-13 15:18:24,506 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188)))) is different from true [2022-12-13 15:18:24,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:24,540 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194)))) is different from true [2022-12-13 15:18:24,608 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:18:24,769 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:18:24,769 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-12-13 15:18:24,774 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-12-13 15:18:24,845 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:18:24,845 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-12-13 15:18:24,850 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-12-13 15:18:24,927 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:18:24,927 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-12-13 15:18:24,938 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-12-13 15:18:24,953 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-12-13 15:18:24,958 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-12-13 15:18:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2022-12-13 15:18:24,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:18:25,146 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-12-13 15:18:25,177 WARN L837 $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_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-13 15:18:25,270 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) .cse2 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 15:18:25,354 WARN L837 $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_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7213))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7214) .cse3 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-13 15:18:27,282 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7213))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308) .cse0 v_ArrVal_7214) .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308) .cse6 v_ArrVal_7214) (select (select (store .cse7 .cse6 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7215))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-13 15:18:27,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:18:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433287464] [2022-12-13 15:18:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433287464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1265393593] [2022-12-13 15:18:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:18:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:18:27,305 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:18:27,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-12-13 15:22:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:22:51,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-13 15:22:51,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:22:51,083 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-12-13 15:22:51,446 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-12-13 15:22:51,489 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:22:51,490 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-12-13 15:22:51,509 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-12-13 15:22:51,533 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-12-13 15:22:51,671 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-12-13 15:22:51,680 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-12-13 15:22:52,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712)))) is different from true [2022-12-13 15:22:52,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713)))) is different from true [2022-12-13 15:22:52,189 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719)))) is different from true [2022-12-13 15:22:52,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:22:52,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725)))) is different from true [2022-12-13 15:22:52,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:22:52,506 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733)))) is different from true [2022-12-13 15:22:52,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737)))) is different from true [2022-12-13 15:22:52,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:52,710 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743)))) is different from true [2022-12-13 15:22:52,735 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:52,823 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750)))) is different from true [2022-12-13 15:22:52,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751)))) is different from true [2022-12-13 15:22:52,872 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753)))) is different from true [2022-12-13 15:22:52,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:52,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:53,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:53,166 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:22:53,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774)))) is different from true [2022-12-13 15:22:53,348 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:22:53,376 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:53,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780)))) is different from true [2022-12-13 15:22:53,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781)))) is different from true [2022-12-13 15:22:53,460 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784)))) is different from true [2022-12-13 15:22:53,489 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:22:53,517 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787)))) is different from true [2022-12-13 15:22:53,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 15:22:53,576 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791)))) is different from true [2022-12-13 15:22:53,672 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:22:53,673 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-12-13 15:22:53,694 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-12-13 15:22:53,818 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:22:53,818 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-12-13 15:22:53,829 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-12-13 15:22:53,953 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:22:53,953 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-12-13 15:22:53,963 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-12-13 15:22:54,019 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-12-13 15:22:54,033 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-12-13 15:22:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-12-13 15:22:54,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:22:54,138 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 15:22:54,188 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-12-13 15:22:54,323 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7793) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7794))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7793) .cse2 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-13 15:22:54,473 WARN L837 $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_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7793) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7794))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7793) .cse3 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-13 15:22:56,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7888))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7887) .cse1 v_ArrVal_7793) (select (select (store .cse2 .cse1 v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7795))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7888))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7794))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7887) .cse4 v_ArrVal_7793) .cse5 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-12-13 15:22:56,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1265393593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:22:56,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:22:56,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 62 [2022-12-13 15:22:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389280438] [2022-12-13 15:22:56,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:22:56,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-13 15:22:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:22:56,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-13 15:22:56,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=177, Unknown=72, NotChecked=5146, Total=5550 [2022-12-13 15:22:56,328 INFO L87 Difference]: Start difference. First operand 4312 states and 6325 transitions. Second operand has 63 states, 61 states have (on average 2.540983606557377) internal successors, (155), 63 states have internal predecessors, (155), 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-12-13 15:22:58,012 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125)))) is different from true [2022-12-13 15:22:58,026 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7128) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7127))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,060 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,079 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,159 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,178 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,197 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7136))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7711))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7137))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7712))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7138 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7138))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7139))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7132 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7132))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720))) (exists ((v_ArrVal_7131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7131))) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7140))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7135))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 15:22:58,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791)))) is different from true [2022-12-13 15:23:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:23:31,392 INFO L93 Difference]: Finished difference Result 6379 states and 9564 transitions. [2022-12-13 15:23:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 15:23:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 2.540983606557377) internal successors, (155), 63 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 125 [2022-12-13 15:23:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:23:31,403 INFO L225 Difference]: With dead ends: 6379 [2022-12-13 15:23:31,403 INFO L226 Difference]: Without dead ends: 6379 [2022-12-13 15:23:31,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 157 SyntacticMatches, 38 SemanticMatches, 93 ConstructedPredicates, 74 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=231, Invalid=393, Unknown=92, NotChecked=8214, Total=8930 [2022-12-13 15:23:31,405 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 1581 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 6101 mSolverCounterSat, 14 mSolverCounterUnsat, 1079 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 96599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 6101 IncrementalHoareTripleChecker+Invalid, 1079 IncrementalHoareTripleChecker+Unknown, 89405 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2022-12-13 15:23:31,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 4020 Invalid, 96599 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 6101 Invalid, 1079 Unknown, 89405 Unchecked, 33.7s Time] [2022-12-13 15:23:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6379 states. [2022-12-13 15:23:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6379 to 4311. [2022-12-13 15:23:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 3635 states have (on average 1.7169188445667125) internal successors, (6241), 4271 states have internal predecessors, (6241), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 15:23:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 6322 transitions. [2022-12-13 15:23:31,450 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 6322 transitions. Word has length 125 [2022-12-13 15:23:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:23:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 4311 states and 6322 transitions. [2022-12-13 15:23:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 2.540983606557377) internal successors, (155), 63 states have internal predecessors, (155), 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-12-13 15:23:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 6322 transitions. [2022-12-13 15:23:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 15:23:31,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:23:31,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:23:31,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-12-13 15:23:31,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2022-12-13 15:23:31,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 15:23:31,853 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-13 15:23:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:23:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2050272682, now seen corresponding path program 1 times [2022-12-13 15:23:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:23:31,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338980856] [2022-12-13 15:23:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:23:31,857 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-12-13 15:23:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:23:31,858 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 15:23:31,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-12-13 15:23:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:23:32,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 15:23:32,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:23:32,806 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-12-13 15:23:33,202 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:23:33,202 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-12-13 15:23:33,259 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-12-13 15:23:33,468 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-12-13 15:23:36,890 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:23:36,890 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-12-13 15:23:37,124 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:23:37,124 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-12-13 15:23:37,339 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:23:37,339 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-12-13 15:23:37,386 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-12-13 15:23:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 15:23:37,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:23:39,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (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_8328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 15:23:39,819 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (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| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-13 15:23:39,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 15:23:40,371 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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~mem39#1.base| v_ArrVal_8374))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 15:23:40,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:23:40,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338980856] [2022-12-13 15:23:40,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338980856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:23:40,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [205750862] [2022-12-13 15:23:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:23:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 15:23:40,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 15:23:40,379 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 15:23:40,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d459bad3-0719-4fa7-8f03-ba4023ec6c75/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2022-12-13 15:24:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:24:30,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 15:24:30,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:24:30,741 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-12-13 15:24:31,141 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:24:31,142 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-12-13 15:24:31,174 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-12-13 15:24:31,324 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-12-13 15:24:32,067 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_109 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (= (bvadd (select |c_#valid| v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8778)))) is different from true [2022-12-13 15:24:34,492 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:24:34,492 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-12-13 15:24:34,647 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:24:34,648 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-12-13 15:24:34,785 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 15:24:34,786 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-12-13 15:24:34,833 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-12-13 15:24:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-13 15:24:34,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:24:34,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8814) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 15:24:34,924 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_8814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 15:24:34,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 15:24:34,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-13 15:24:35,523 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8860))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8813)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-13 15:24:35,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [205750862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:24:35,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:24:35,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2022-12-13 15:24:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967592972] [2022-12-13 15:24:35,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:24:35,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 15:24:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:24:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 15:24:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=140, Unknown=23, NotChecked=330, Total=552 [2022-12-13 15:24:35,531 INFO L87 Difference]: Start difference. First operand 4311 states and 6322 transitions. Second operand has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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)