./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:56:55,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:56:55,246 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:56:55,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:56:55,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:56:55,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:56:55,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:56:55,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:56:55,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:56:55,276 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:56:55,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:56:55,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:56:55,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:56:55,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:56:55,279 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:56:55,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:56:55,280 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:56:55,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:56:55,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:56:55,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:56:55,282 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:56:55,283 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:56:55,283 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:56:55,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:56:55,284 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:56:55,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:56:55,285 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:56:55,286 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:56:55,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:56:55,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:56:55,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:56:55,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:56:55,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:56:55,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:56:55,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:56:55,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:56:55,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:56:55,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:56:55,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:56:55,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:56:55,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:56:55,290 INFO L153 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_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/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_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2023-11-29 00:56:55,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:56:55,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:56:55,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:56:55,535 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:56:55,536 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:56:55,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2023-11-29 00:56:58,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:56:58,614 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:56:58,615 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2023-11-29 00:56:58,638 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data/7eebe1c4f/ab61c301bcd54c08aac989c0d7a846a9/FLAG0a262eddb [2023-11-29 00:56:58,657 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data/7eebe1c4f/ab61c301bcd54c08aac989c0d7a846a9 [2023-11-29 00:56:58,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:56:58,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:56:58,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:56:58,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:56:58,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:56:58,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:56:58" (1/1) ... [2023-11-29 00:56:58,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4289a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:56:58, skipping insertion in model container [2023-11-29 00:56:58,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:56:58" (1/1) ... [2023-11-29 00:56:58,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:56:59,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:56:59,429 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 00:56:59,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3aa6a96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:56:59, skipping insertion in model container [2023-11-29 00:56:59,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:56:59,431 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:56:59,433 INFO L158 Benchmark]: Toolchain (without parser) took 769.52ms. Allocated memory is still 157.3MB. Free memory was 120.0MB in the beginning and 99.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:56:59,434 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:56:59,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.28ms. Allocated memory is still 157.3MB. Free memory was 119.5MB in the beginning and 99.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:56:59,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.28ms. Allocated memory is still 157.3MB. Free memory was 119.5MB in the beginning and 99.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 817]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:57:01,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:57:01,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:57:01,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:57:01,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:57:01,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:57:01,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:57:01,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:57:01,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:57:01,658 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:57:01,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:57:01,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:57:01,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:57:01,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:57:01,661 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:57:01,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:57:01,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:57:01,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:57:01,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:57:01,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:57:01,665 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:57:01,666 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:57:01,667 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:57:01,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:57:01,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:57:01,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:57:01,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:57:01,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:57:01,670 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:57:01,671 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:57:01,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:57:01,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:57:01,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:57:01,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:57:01,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:57:01,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:57:01,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:57:01,674 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:57:01,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:57:01,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:57:01,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:57:01,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:57:01,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:57:01,675 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:57:01,675 INFO L153 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_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/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_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2023-11-29 00:57:02,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:57:02,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:57:02,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:57:02,060 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:57:02,060 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:57:02,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2023-11-29 00:57:05,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:57:05,363 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:57:05,364 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2023-11-29 00:57:05,387 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data/d40dbe829/02a0b127a1ab48da9211ebb733f0d88a/FLAG82032afc6 [2023-11-29 00:57:05,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/data/d40dbe829/02a0b127a1ab48da9211ebb733f0d88a [2023-11-29 00:57:05,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:57:05,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:57:05,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:57:05,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:57:05,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:57:05,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:57:05" (1/1) ... [2023-11-29 00:57:05,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c2e3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:05, skipping insertion in model container [2023-11-29 00:57:05,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:57:05" (1/1) ... [2023-11-29 00:57:05,497 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:57:06,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:57:06,123 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:57:06,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:57:06,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:57:06,230 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:57:06,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:57:06,379 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:57:06,389 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:57:06,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06 WrapperNode [2023-11-29 00:57:06,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:57:06,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:57:06,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:57:06,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:57:06,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,504 INFO L138 Inliner]: procedures = 210, calls = 281, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1040 [2023-11-29 00:57:06,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:57:06,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:57:06,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:57:06,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:57:06,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,625 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 34, 5, 218]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 4, 1, 50]. [2023-11-29 00:57:06,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:57:06,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:57:06,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:57:06,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:57:06,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (1/1) ... [2023-11-29 00:57:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:57:06,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:57:06,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:57:06,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:57:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:57:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:57:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:57:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:57:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 00:57:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 00:57:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 00:57:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 00:57:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 00:57:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 00:57:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:57:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 00:57:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:57:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:57:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:57:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:57:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:57:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:57:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:57:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:57:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:57:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:57:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:57:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:57:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:57:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:57:06,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:57:07,097 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:57:07,100 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:57:07,105 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:57:07,166 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:57:07,192 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:57:07,216 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:57:11,210 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:57:11,366 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:57:11,366 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 00:57:11,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:57:11 BoogieIcfgContainer [2023-11-29 00:57:11,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:57:11,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:57:11,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:57:11,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:57:11,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:57:05" (1/3) ... [2023-11-29 00:57:11,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818457c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:57:11, skipping insertion in model container [2023-11-29 00:57:11,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:06" (2/3) ... [2023-11-29 00:57:11,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818457c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:57:11, skipping insertion in model container [2023-11-29 00:57:11,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:57:11" (3/3) ... [2023-11-29 00:57:11,378 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2023-11-29 00:57:11,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:57:11,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2023-11-29 00:57:11,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:57:11,474 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;@56454878, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:57:11,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2023-11-29 00:57:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 430 states have (on average 2.5209302325581397) internal successors, (1084), 958 states have internal predecessors, (1084), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 00:57:11,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:11,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 00:57:11,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr530ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:11,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1689533, now seen corresponding path program 1 times [2023-11-29 00:57:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514419548] [2023-11-29 00:57:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:11,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:11,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:11,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:11,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:57:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:11,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:57:11,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:11,877 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_53| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_53| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_53|)))) is different from true [2023-11-29 00:57:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:11,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:11,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514419548] [2023-11-29 00:57:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514419548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:11,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:11,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:11,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337351523] [2023-11-29 00:57:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:11,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:11,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 00:57:11,921 INFO L87 Difference]: Start difference. First operand has 963 states, 430 states have (on average 2.5209302325581397) internal successors, (1084), 958 states have internal predecessors, (1084), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:14,863 INFO L93 Difference]: Finished difference Result 1319 states and 1408 transitions. [2023-11-29 00:57:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 00:57:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:14,885 INFO L225 Difference]: With dead ends: 1319 [2023-11-29 00:57:14,885 INFO L226 Difference]: Without dead ends: 1317 [2023-11-29 00:57:14,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 00:57:14,889 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 396 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1409 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:14,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1222 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 1409 Unchecked, 2.8s Time] [2023-11-29 00:57:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-11-29 00:57:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 952. [2023-11-29 00:57:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 425 states have (on average 2.36) internal successors, (1003), 947 states have internal predecessors, (1003), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1009 transitions. [2023-11-29 00:57:14,961 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1009 transitions. Word has length 3 [2023-11-29 00:57:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:14,961 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1009 transitions. [2023-11-29 00:57:14,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1009 transitions. [2023-11-29 00:57:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 00:57:14,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:14,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 00:57:14,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:57:15,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:15,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:15,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1687933, now seen corresponding path program 1 times [2023-11-29 00:57:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:15,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117447365] [2023-11-29 00:57:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:15,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:15,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:15,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:15,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:57:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:15,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:15,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:15,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:57:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:15,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:15,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117447365] [2023-11-29 00:57:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117447365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:57:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508785439] [2023-11-29 00:57:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:15,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:15,316 INFO L87 Difference]: Start difference. First operand 952 states and 1009 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:17,287 INFO L93 Difference]: Finished difference Result 1115 states and 1181 transitions. [2023-11-29 00:57:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:17,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 00:57:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:17,294 INFO L225 Difference]: With dead ends: 1115 [2023-11-29 00:57:17,294 INFO L226 Difference]: Without dead ends: 1115 [2023-11-29 00:57:17,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:17,296 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 893 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:17,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 642 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 00:57:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-11-29 00:57:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 950. [2023-11-29 00:57:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 433 states have (on average 2.3140877598152425) internal successors, (1002), 945 states have internal predecessors, (1002), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1008 transitions. [2023-11-29 00:57:17,326 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1008 transitions. Word has length 3 [2023-11-29 00:57:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:17,326 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1008 transitions. [2023-11-29 00:57:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1008 transitions. [2023-11-29 00:57:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 00:57:17,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:17,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 00:57:17,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:17,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:17,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:17,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1687934, now seen corresponding path program 1 times [2023-11-29 00:57:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934644389] [2023-11-29 00:57:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:17,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:17,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:17,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:17,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:57:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:17,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:57:17,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:17,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:57:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:17,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:17,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:17,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934644389] [2023-11-29 00:57:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934644389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:17,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:57:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996367008] [2023-11-29 00:57:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:17,670 INFO L87 Difference]: Start difference. First operand 950 states and 1008 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:20,895 INFO L93 Difference]: Finished difference Result 1318 states and 1408 transitions. [2023-11-29 00:57:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:20,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 00:57:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:20,903 INFO L225 Difference]: With dead ends: 1318 [2023-11-29 00:57:20,903 INFO L226 Difference]: Without dead ends: 1318 [2023-11-29 00:57:20,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:20,905 INFO L413 NwaCegarLoop]: 746 mSDtfsCounter, 400 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1225 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:57:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2023-11-29 00:57:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1051. [2023-11-29 00:57:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 535 states have (on average 2.2523364485981308) internal successors, (1205), 1046 states have internal predecessors, (1205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1211 transitions. [2023-11-29 00:57:20,936 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1211 transitions. Word has length 3 [2023-11-29 00:57:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:20,936 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1211 transitions. [2023-11-29 00:57:20,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1211 transitions. [2023-11-29 00:57:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:57:20,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:20,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:20,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:21,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:21,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:21,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -230933561, now seen corresponding path program 1 times [2023-11-29 00:57:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164194935] [2023-11-29 00:57:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:21,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:21,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:21,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:57:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:21,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:57:21,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:21,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:57:21,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:57:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:57:21,371 INFO L378 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 14 treesize of output 9 [2023-11-29 00:57:21,395 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:57:21,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:57:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:21,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:21,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164194935] [2023-11-29 00:57:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164194935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120472470] [2023-11-29 00:57:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:21,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:21,424 INFO L87 Difference]: Start difference. First operand 1051 states and 1211 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-11-29 00:57:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:24,729 INFO L93 Difference]: Finished difference Result 1205 states and 1373 transitions. [2023-11-29 00:57:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:24,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 [2023-11-29 00:57:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:24,737 INFO L225 Difference]: With dead ends: 1205 [2023-11-29 00:57:24,737 INFO L226 Difference]: Without dead ends: 1205 [2023-11-29 00:57:24,737 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 [2023-11-29 00:57:24,738 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 1146 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:24,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 315 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:57:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-29 00:57:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 939. [2023-11-29 00:57:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 433 states have (on average 2.2863741339491916) internal successors, (990), 934 states have internal predecessors, (990), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 996 transitions. [2023-11-29 00:57:24,764 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 996 transitions. Word has length 7 [2023-11-29 00:57:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:24,764 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 996 transitions. [2023-11-29 00:57:24,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-11-29 00:57:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 996 transitions. [2023-11-29 00:57:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:57:24,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:24,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:24,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:24,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:24,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:24,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1430994207, now seen corresponding path program 1 times [2023-11-29 00:57:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:24,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829629467] [2023-11-29 00:57:24,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:24,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:24,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:57:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:25,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:25,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:25,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:57:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:25,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:25,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829629467] [2023-11-29 00:57:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829629467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063540463] [2023-11-29 00:57:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:25,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:25,116 INFO L87 Difference]: Start difference. First operand 939 states and 996 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) [2023-11-29 00:57:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:27,100 INFO L93 Difference]: Finished difference Result 1079 states and 1157 transitions. [2023-11-29 00:57:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:27,102 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 [2023-11-29 00:57:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:27,108 INFO L225 Difference]: With dead ends: 1079 [2023-11-29 00:57:27,108 INFO L226 Difference]: Without dead ends: 1079 [2023-11-29 00:57:27,108 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 [2023-11-29 00:57:27,109 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 719 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:27,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 914 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 00:57:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-11-29 00:57:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 892. [2023-11-29 00:57:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 433 states have (on average 2.1778290993071594) internal successors, (943), 887 states have internal predecessors, (943), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 949 transitions. [2023-11-29 00:57:27,131 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 949 transitions. Word has length 8 [2023-11-29 00:57:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:27,131 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 949 transitions. [2023-11-29 00:57:27,132 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) [2023-11-29 00:57:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 949 transitions. [2023-11-29 00:57:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:57:27,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:27,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:27,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:27,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:27,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:27,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1430994208, now seen corresponding path program 1 times [2023-11-29 00:57:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:27,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554050134] [2023-11-29 00:57:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:27,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:27,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:57:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:27,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:57:27,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:27,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:57:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:27,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:27,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554050134] [2023-11-29 00:57:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554050134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936943644] [2023-11-29 00:57:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:27,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:27,489 INFO L87 Difference]: Start difference. First operand 892 states and 949 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) [2023-11-29 00:57:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:30,513 INFO L93 Difference]: Finished difference Result 1137 states and 1218 transitions. [2023-11-29 00:57:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:30,515 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 [2023-11-29 00:57:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:30,519 INFO L225 Difference]: With dead ends: 1137 [2023-11-29 00:57:30,519 INFO L226 Difference]: Without dead ends: 1137 [2023-11-29 00:57:30,520 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 [2023-11-29 00:57:30,520 INFO L413 NwaCegarLoop]: 857 mSDtfsCounter, 437 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:30,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1198 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 00:57:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-11-29 00:57:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 905. [2023-11-29 00:57:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 456 states have (on average 2.1710526315789473) internal successors, (990), 900 states have internal predecessors, (990), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 996 transitions. [2023-11-29 00:57:30,536 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 996 transitions. Word has length 8 [2023-11-29 00:57:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:30,536 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 996 transitions. [2023-11-29 00:57:30,536 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) [2023-11-29 00:57:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 996 transitions. [2023-11-29 00:57:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:57:30,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:30,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:30,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:57:30,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:30,738 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:30,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1834819724, now seen corresponding path program 1 times [2023-11-29 00:57:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527906859] [2023-11-29 00:57:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:30,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:30,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:30,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:57:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:30,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:30,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:30,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:30,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:30,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527906859] [2023-11-29 00:57:30,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527906859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:30,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:30,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:30,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300674220] [2023-11-29 00:57:30,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:30,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:30,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:30,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:30,940 INFO L87 Difference]: Start difference. First operand 905 states and 996 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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) [2023-11-29 00:57:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:32,226 INFO L93 Difference]: Finished difference Result 1323 states and 1449 transitions. [2023-11-29 00:57:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:32,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 [2023-11-29 00:57:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:32,233 INFO L225 Difference]: With dead ends: 1323 [2023-11-29 00:57:32,233 INFO L226 Difference]: Without dead ends: 1323 [2023-11-29 00:57:32,233 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 [2023-11-29 00:57:32,234 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 503 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:32,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1566 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 00:57:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-11-29 00:57:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1048. [2023-11-29 00:57:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 599 states have (on average 2.0901502504173624) internal successors, (1252), 1043 states have internal predecessors, (1252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1258 transitions. [2023-11-29 00:57:32,253 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1258 transitions. Word has length 11 [2023-11-29 00:57:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:32,253 INFO L495 AbstractCegarLoop]: Abstraction has 1048 states and 1258 transitions. [2023-11-29 00:57:32,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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) [2023-11-29 00:57:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1258 transitions. [2023-11-29 00:57:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:57:32,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:32,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:32,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 00:57:32,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:32,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:32,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1625377008, now seen corresponding path program 1 times [2023-11-29 00:57:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:32,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607908449] [2023-11-29 00:57:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:32,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:32,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:32,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:32,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:57:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:32,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:57:32,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57: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. [2023-11-29 00:57:32,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:32,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607908449] [2023-11-29 00:57:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607908449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739292825] [2023-11-29 00:57:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:32,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:32,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:32,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:32,580 INFO L87 Difference]: Start difference. First operand 1048 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:33,445 INFO L93 Difference]: Finished difference Result 994 states and 1178 transitions. [2023-11-29 00:57:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 00:57:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:33,451 INFO L225 Difference]: With dead ends: 994 [2023-11-29 00:57:33,451 INFO L226 Difference]: Without dead ends: 994 [2023-11-29 00:57:33,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:33,452 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 70 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:33,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1505 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:57:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-11-29 00:57:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2023-11-29 00:57:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 569 states have (on average 2.0597539543057994) internal successors, (1172), 989 states have internal predecessors, (1172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1178 transitions. [2023-11-29 00:57:33,472 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1178 transitions. Word has length 13 [2023-11-29 00:57:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:33,472 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1178 transitions. [2023-11-29 00:57:33,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1178 transitions. [2023-11-29 00:57:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:57:33,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:33,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:33,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:33,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:33,674 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:33,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash 941513535, now seen corresponding path program 1 times [2023-11-29 00:57:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:33,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741102580] [2023-11-29 00:57:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:33,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:33,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:33,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:57:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:33,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:57:33,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:33,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:33,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741102580] [2023-11-29 00:57:33,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741102580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:33,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:33,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:57:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449275314] [2023-11-29 00:57:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:33,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:57:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:57:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:33,846 INFO L87 Difference]: Start difference. First operand 994 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:36,178 INFO L93 Difference]: Finished difference Result 1250 states and 1373 transitions. [2023-11-29 00:57:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:57:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-29 00:57:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:36,185 INFO L225 Difference]: With dead ends: 1250 [2023-11-29 00:57:36,185 INFO L226 Difference]: Without dead ends: 1250 [2023-11-29 00:57:36,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:57:36,186 INFO L413 NwaCegarLoop]: 836 mSDtfsCounter, 480 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:36,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2939 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:57:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-11-29 00:57:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 996. [2023-11-29 00:57:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 571 states have (on average 2.0560420315236425) internal successors, (1174), 991 states have internal predecessors, (1174), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1180 transitions. [2023-11-29 00:57:36,210 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1180 transitions. Word has length 14 [2023-11-29 00:57:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:36,210 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1180 transitions. [2023-11-29 00:57:36,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1180 transitions. [2023-11-29 00:57:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:57:36,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:36,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:36,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:57:36,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:36,414 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr530ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:36,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 941520445, now seen corresponding path program 1 times [2023-11-29 00:57:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664821571] [2023-11-29 00:57:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:36,416 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:36,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:57:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:36,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:57:36,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:36,690 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_54| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_54|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_54| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-29 00:57:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:36,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:36,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:36,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664821571] [2023-11-29 00:57:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664821571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:36,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:36,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36367973] [2023-11-29 00:57:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:36,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 00:57:36,693 INFO L87 Difference]: Start difference. First operand 996 states and 1180 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:38,642 INFO L93 Difference]: Finished difference Result 1082 states and 1277 transitions. [2023-11-29 00:57:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-29 00:57:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:38,647 INFO L225 Difference]: With dead ends: 1082 [2023-11-29 00:57:38,647 INFO L226 Difference]: Without dead ends: 1076 [2023-11-29 00:57:38,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 00:57:38,648 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 90 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 991 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1214 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 565 Invalid, 0 Unknown, 991 Unchecked, 1.9s Time] [2023-11-29 00:57:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2023-11-29 00:57:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1051. [2023-11-29 00:57:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 626 states have (on average 2.0175718849840254) internal successors, (1263), 1046 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1269 transitions. [2023-11-29 00:57:38,664 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1269 transitions. Word has length 14 [2023-11-29 00:57:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:38,664 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1269 transitions. [2023-11-29 00:57:38,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1269 transitions. [2023-11-29 00:57:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:57:38,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:38,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:38,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:38,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:38,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:38,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1380764822, now seen corresponding path program 1 times [2023-11-29 00:57:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146751693] [2023-11-29 00:57:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:38,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:38,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:38,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:38,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:57:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:38,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:38,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:39,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:39,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:39,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146751693] [2023-11-29 00:57:39,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146751693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:57:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051681761] [2023-11-29 00:57:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:39,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:39,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:39,019 INFO L87 Difference]: Start difference. First operand 1051 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:40,074 INFO L93 Difference]: Finished difference Result 1037 states and 1206 transitions. [2023-11-29 00:57:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:57:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:40,081 INFO L225 Difference]: With dead ends: 1037 [2023-11-29 00:57:40,081 INFO L226 Difference]: Without dead ends: 1037 [2023-11-29 00:57:40,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:40,081 INFO L413 NwaCegarLoop]: 746 mSDtfsCounter, 58 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:40,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2214 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:57:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2023-11-29 00:57:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1034. [2023-11-29 00:57:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 623 states have (on average 1.9213483146067416) internal successors, (1197), 1029 states have internal predecessors, (1197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1203 transitions. [2023-11-29 00:57:40,096 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1203 transitions. Word has length 15 [2023-11-29 00:57:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:40,096 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1203 transitions. [2023-11-29 00:57:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1203 transitions. [2023-11-29 00:57:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 00:57:40,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:40,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:40,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 00:57:40,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:40,299 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:40,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash 771501622, now seen corresponding path program 1 times [2023-11-29 00:57:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184348312] [2023-11-29 00:57:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:40,301 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:40,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 00:57:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:40,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:57:40,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:40,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:40,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184348312] [2023-11-29 00:57:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184348312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:40,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:40,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580359027] [2023-11-29 00:57:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:40,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:40,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:40,467 INFO L87 Difference]: Start difference. First operand 1034 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:41,235 INFO L93 Difference]: Finished difference Result 980 states and 1123 transitions. [2023-11-29 00:57:41,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:41,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-29 00:57:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:41,241 INFO L225 Difference]: With dead ends: 980 [2023-11-29 00:57:41,241 INFO L226 Difference]: Without dead ends: 980 [2023-11-29 00:57:41,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:41,241 INFO L413 NwaCegarLoop]: 719 mSDtfsCounter, 70 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1389 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:57:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2023-11-29 00:57:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2023-11-29 00:57:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 593 states have (on average 1.8836424957841484) internal successors, (1117), 975 states have internal predecessors, (1117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1123 transitions. [2023-11-29 00:57:41,256 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1123 transitions. Word has length 16 [2023-11-29 00:57:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:41,256 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1123 transitions. [2023-11-29 00:57:41,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1123 transitions. [2023-11-29 00:57:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 00:57:41,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:41,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:41,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:41,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:41,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:41,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1616286064, now seen corresponding path program 1 times [2023-11-29 00:57:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141205055] [2023-11-29 00:57:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:41,462 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:41,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:57:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:41,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:41,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:41,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:41,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141205055] [2023-11-29 00:57:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141205055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:41,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:41,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:57:41,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187610443] [2023-11-29 00:57:41,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:41,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:41,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:41,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:41,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:41,641 INFO L87 Difference]: Start difference. First operand 980 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:42,569 INFO L93 Difference]: Finished difference Result 966 states and 1081 transitions. [2023-11-29 00:57:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:42,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 00:57:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:42,575 INFO L225 Difference]: With dead ends: 966 [2023-11-29 00:57:42,575 INFO L226 Difference]: Without dead ends: 966 [2023-11-29 00:57:42,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:42,575 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 58 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:42,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2040 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:57:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-11-29 00:57:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2023-11-29 00:57:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 591 states have (on average 1.8155668358714043) internal successors, (1073), 959 states have internal predecessors, (1073), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1079 transitions. [2023-11-29 00:57:42,588 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1079 transitions. Word has length 18 [2023-11-29 00:57:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:42,588 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1079 transitions. [2023-11-29 00:57:42,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1079 transitions. [2023-11-29 00:57:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 00:57:42,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:42,589 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] [2023-11-29 00:57:42,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:42,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:42,790 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr378REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:42,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 32152248, now seen corresponding path program 1 times [2023-11-29 00:57:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912453008] [2023-11-29 00:57:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:42,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:42,792 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:42,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:57:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:42,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:57:42,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:42,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:57:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:42,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:42,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:42,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912453008] [2023-11-29 00:57:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912453008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:42,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:42,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969209568] [2023-11-29 00:57:42,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:42,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:42,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:42,988 INFO L87 Difference]: Start difference. First operand 964 states and 1079 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:45,048 INFO L93 Difference]: Finished difference Result 1124 states and 1240 transitions. [2023-11-29 00:57:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-11-29 00:57:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:45,053 INFO L225 Difference]: With dead ends: 1124 [2023-11-29 00:57:45,053 INFO L226 Difference]: Without dead ends: 1124 [2023-11-29 00:57:45,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:45,053 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 706 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:45,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 926 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 00:57:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-11-29 00:57:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 960. [2023-11-29 00:57:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 591 states have (on average 1.7952622673434857) internal successors, (1061), 955 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1067 transitions. [2023-11-29 00:57:45,066 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1067 transitions. Word has length 29 [2023-11-29 00:57:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:45,067 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1067 transitions. [2023-11-29 00:57:45,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1067 transitions. [2023-11-29 00:57:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 00:57:45,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:45,068 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] [2023-11-29 00:57:45,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:45,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:45,268 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:45,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 32152249, now seen corresponding path program 1 times [2023-11-29 00:57:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804762080] [2023-11-29 00:57:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:45,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:45,270 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:45,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 00:57:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:57:45,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:45,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:57:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:45,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:45,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:45,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804762080] [2023-11-29 00:57:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804762080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:57:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707156924] [2023-11-29 00:57:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:45,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:45,562 INFO L87 Difference]: Start difference. First operand 960 states and 1067 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:48,521 INFO L93 Difference]: Finished difference Result 963 states and 1065 transitions. [2023-11-29 00:57:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:48,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-11-29 00:57:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:48,527 INFO L225 Difference]: With dead ends: 963 [2023-11-29 00:57:48,527 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 00:57:48,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:48,528 INFO L413 NwaCegarLoop]: 699 mSDtfsCounter, 68 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:48,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1437 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 00:57:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 00:57:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 960. [2023-11-29 00:57:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 591 states have (on average 1.7884940778341794) internal successors, (1057), 955 states have internal predecessors, (1057), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1063 transitions. [2023-11-29 00:57:48,541 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1063 transitions. Word has length 29 [2023-11-29 00:57:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:48,541 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1063 transitions. [2023-11-29 00:57:48,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1063 transitions. [2023-11-29 00:57:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:57:48,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:48,542 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] [2023-11-29 00:57:48,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 00:57:48,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:48,743 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:48,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 430509822, now seen corresponding path program 1 times [2023-11-29 00:57:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899541012] [2023-11-29 00:57:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:48,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:48,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:48,744 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:48,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 00:57:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:48,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:57:48,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:48,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:57:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:48,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:48,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:48,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899541012] [2023-11-29 00:57:48,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899541012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:48,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004841817] [2023-11-29 00:57:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:48,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:48,978 INFO L87 Difference]: Start difference. First operand 960 states and 1063 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:51,278 INFO L93 Difference]: Finished difference Result 1140 states and 1262 transitions. [2023-11-29 00:57:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 00:57:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:51,285 INFO L225 Difference]: With dead ends: 1140 [2023-11-29 00:57:51,285 INFO L226 Difference]: Without dead ends: 1140 [2023-11-29 00:57:51,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:51,286 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 580 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:51,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1058 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:57:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-11-29 00:57:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 956. [2023-11-29 00:57:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 591 states have (on average 1.7749576988155669) internal successors, (1049), 951 states have internal predecessors, (1049), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1055 transitions. [2023-11-29 00:57:51,300 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1055 transitions. Word has length 32 [2023-11-29 00:57:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:51,300 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1055 transitions. [2023-11-29 00:57:51,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1055 transitions. [2023-11-29 00:57:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:57:51,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:51,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:51,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:51,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:51,502 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:51,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 430509823, now seen corresponding path program 1 times [2023-11-29 00:57:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838442644] [2023-11-29 00:57:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:51,504 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:51,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 00:57:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:51,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:57:51,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:57:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:51,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:51,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838442644] [2023-11-29 00:57:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838442644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020200010] [2023-11-29 00:57:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:51,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:51,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:51,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:51,835 INFO L87 Difference]: Start difference. First operand 956 states and 1055 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:55,359 INFO L93 Difference]: Finished difference Result 1181 states and 1268 transitions. [2023-11-29 00:57:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 00:57:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:55,367 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 00:57:55,367 INFO L226 Difference]: Without dead ends: 1181 [2023-11-29 00:57:55,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:55,367 INFO L413 NwaCegarLoop]: 787 mSDtfsCounter, 300 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:55,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1548 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 00:57:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-11-29 00:57:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 952. [2023-11-29 00:57:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 591 states have (on average 1.7614213197969544) internal successors, (1041), 947 states have internal predecessors, (1041), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1047 transitions. [2023-11-29 00:57:55,380 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1047 transitions. Word has length 32 [2023-11-29 00:57:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:55,381 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1047 transitions. [2023-11-29 00:57:55,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1047 transitions. [2023-11-29 00:57:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 00:57:55,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:55,382 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] [2023-11-29 00:57:55,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:55,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr420ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:55,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1197752889, now seen corresponding path program 1 times [2023-11-29 00:57:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257279680] [2023-11-29 00:57:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:55,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:55,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:55,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:55,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 00:57:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:55,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:55,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:55,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:55,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257279680] [2023-11-29 00:57:55,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257279680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:55,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:57:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331357574] [2023-11-29 00:57:55,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:55,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:55,766 INFO L87 Difference]: Start difference. First operand 952 states and 1047 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:56,806 INFO L93 Difference]: Finished difference Result 934 states and 1017 transitions. [2023-11-29 00:57:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:56,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2023-11-29 00:57:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:56,811 INFO L225 Difference]: With dead ends: 934 [2023-11-29 00:57:56,811 INFO L226 Difference]: Without dead ends: 934 [2023-11-29 00:57:56,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:57:56,812 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 31 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:56,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2006 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:57:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-11-29 00:57:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2023-11-29 00:57:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 573 states have (on average 1.7643979057591623) internal successors, (1011), 929 states have internal predecessors, (1011), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1017 transitions. [2023-11-29 00:57:56,823 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1017 transitions. Word has length 49 [2023-11-29 00:57:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:56,823 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1017 transitions. [2023-11-29 00:57:56,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1017 transitions. [2023-11-29 00:57:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 00:57:56,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:56,824 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] [2023-11-29 00:57:56,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:57,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:57,024 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:57,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 260949999, now seen corresponding path program 1 times [2023-11-29 00:57:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713168892] [2023-11-29 00:57:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:57,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:57,026 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:57,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 00:57:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:57,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:57:57,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:57,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:57,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713168892] [2023-11-29 00:57:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713168892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:57,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:57:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854165984] [2023-11-29 00:57:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:57,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:57:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:57:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:57:57,307 INFO L87 Difference]: Start difference. First operand 934 states and 1017 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) [2023-11-29 00:57:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:58,297 INFO L93 Difference]: Finished difference Result 922 states and 997 transitions. [2023-11-29 00:57:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:57:58,298 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 [2023-11-29 00:57:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:58,302 INFO L225 Difference]: With dead ends: 922 [2023-11-29 00:57:58,302 INFO L226 Difference]: Without dead ends: 922 [2023-11-29 00:57:58,302 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 [2023-11-29 00:57:58,302 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 23 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:58,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2002 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:57:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-11-29 00:57:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2023-11-29 00:57:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 561 states have (on average 1.7664884135472372) internal successors, (991), 917 states have internal predecessors, (991), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:57:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 997 transitions. [2023-11-29 00:57:58,314 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 997 transitions. Word has length 51 [2023-11-29 00:57:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:58,314 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 997 transitions. [2023-11-29 00:57:58,314 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) [2023-11-29 00:57:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 997 transitions. [2023-11-29 00:57:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 00:57:58,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:58,315 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] [2023-11-29 00:57:58,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:57:58,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:58,516 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr420ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:57:58,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1312593031, now seen corresponding path program 1 times [2023-11-29 00:57:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786847558] [2023-11-29 00:57:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:58,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:57:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:58,517 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:57:58,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 00:57:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:58,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:57:58,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:58,740 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:57:58,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:57:58,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:57:58,745 INFO L378 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 [2023-11-29 00:57:58,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:57:58,814 INFO L378 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 [2023-11-29 00:57:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:57:58,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:57:58,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:58,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786847558] [2023-11-29 00:57:58,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786847558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:58,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:57:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996062004] [2023-11-29 00:57:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:58,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:57:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:57:58,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:57:58,865 INFO L87 Difference]: Start difference. First operand 922 states and 997 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:58:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:01,155 INFO L93 Difference]: Finished difference Result 1543 states and 1649 transitions. [2023-11-29 00:58:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:58:01,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-29 00:58:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:01,162 INFO L225 Difference]: With dead ends: 1543 [2023-11-29 00:58:01,163 INFO L226 Difference]: Without dead ends: 1540 [2023-11-29 00:58:01,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:58:01,163 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1489 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:01,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 3231 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 00:58:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2023-11-29 00:58:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 873. [2023-11-29 00:58:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 512 states have (on average 1.8359375) internal successors, (940), 868 states have internal predecessors, (940), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:58:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 946 transitions. [2023-11-29 00:58:01,185 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 946 transitions. Word has length 53 [2023-11-29 00:58:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:01,186 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 946 transitions. [2023-11-29 00:58:01,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:58:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 946 transitions. [2023-11-29 00:58:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:58:01,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:01,187 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] [2023-11-29 00:58:01,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:01,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:01,387 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:01,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 167829997, now seen corresponding path program 1 times [2023-11-29 00:58:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693701483] [2023-11-29 00:58:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:01,389 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:01,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 00:58:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:01,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:58:01,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:01,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:58:01,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:58:02,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:58:02,195 INFO L378 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 14 treesize of output 9 [2023-11-29 00:58:02,206 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:58:02,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:58:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:02,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:02,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:02,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693701483] [2023-11-29 00:58:02,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693701483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:02,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:02,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:58:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089990609] [2023-11-29 00:58:02,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:02,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:58:02,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:58:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:58:02,231 INFO L87 Difference]: Start difference. First operand 873 states and 946 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:58:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:04,914 INFO L93 Difference]: Finished difference Result 1007 states and 1095 transitions. [2023-11-29 00:58:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:58:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-11-29 00:58:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:04,920 INFO L225 Difference]: With dead ends: 1007 [2023-11-29 00:58:04,920 INFO L226 Difference]: Without dead ends: 1007 [2023-11-29 00:58:04,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:58:04,921 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 613 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:04,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 535 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 00:58:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-11-29 00:58:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 812. [2023-11-29 00:58:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 489 states have (on average 1.7280163599182004) internal successors, (845), 807 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:58:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 851 transitions. [2023-11-29 00:58:04,932 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 851 transitions. Word has length 55 [2023-11-29 00:58:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:04,932 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 851 transitions. [2023-11-29 00:58:04,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:58:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 851 transitions. [2023-11-29 00:58:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 00:58:04,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:04,933 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] [2023-11-29 00:58:04,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:05,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:05,134 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:05,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -937894595, now seen corresponding path program 1 times [2023-11-29 00:58:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833795784] [2023-11-29 00:58:05,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:05,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:05,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:05,135 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:05,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 00:58:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:05,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:58:05,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:05,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:58:05,407 INFO L378 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 19 treesize of output 1 [2023-11-29 00:58:05,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 00:58:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:05,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:05,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833795784] [2023-11-29 00:58:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833795784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:58:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402828299] [2023-11-29 00:58:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:05,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:58:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:58:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:05,445 INFO L87 Difference]: Start difference. First operand 812 states and 851 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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) [2023-11-29 00:58:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:08,331 INFO L93 Difference]: Finished difference Result 811 states and 850 transitions. [2023-11-29 00:58:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:58:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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 [2023-11-29 00:58:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:08,335 INFO L225 Difference]: With dead ends: 811 [2023-11-29 00:58:08,336 INFO L226 Difference]: Without dead ends: 811 [2023-11-29 00:58:08,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:58:08,336 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 3 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:08,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1681 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:58:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-11-29 00:58:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2023-11-29 00:58:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 489 states have (on average 1.7259713701431494) internal successors, (844), 806 states have internal predecessors, (844), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:58:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 850 transitions. [2023-11-29 00:58:08,352 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 850 transitions. Word has length 59 [2023-11-29 00:58:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:08,352 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 850 transitions. [2023-11-29 00:58:08,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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) [2023-11-29 00:58:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 850 transitions. [2023-11-29 00:58:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 00:58:08,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:08,353 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] [2023-11-29 00:58:08,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:08,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:08,553 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:08,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash -937894594, now seen corresponding path program 1 times [2023-11-29 00:58:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:08,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162124812] [2023-11-29 00:58:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:08,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:08,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:08,555 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:08,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:08,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:58:08,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:08,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:58:08,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:58:08,861 INFO L378 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 19 treesize of output 1 [2023-11-29 00:58:08,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 00:58:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:08,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:08,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:08,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162124812] [2023-11-29 00:58:08,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162124812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:08,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:58:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303587804] [2023-11-29 00:58:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:08,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:58:08,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:08,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:58:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:08,918 INFO L87 Difference]: Start difference. First operand 811 states and 850 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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) [2023-11-29 00:58:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:12,942 INFO L93 Difference]: Finished difference Result 810 states and 849 transitions. [2023-11-29 00:58:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:58:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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 [2023-11-29 00:58:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:12,948 INFO L225 Difference]: With dead ends: 810 [2023-11-29 00:58:12,949 INFO L226 Difference]: Without dead ends: 810 [2023-11-29 00:58:12,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:58:12,949 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 1 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:12,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1703 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:58:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2023-11-29 00:58:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2023-11-29 00:58:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 488 states have (on average 1.7274590163934427) internal successors, (843), 805 states have internal predecessors, (843), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:58:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 849 transitions. [2023-11-29 00:58:12,964 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 849 transitions. Word has length 59 [2023-11-29 00:58:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:12,964 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 849 transitions. [2023-11-29 00:58:12,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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) [2023-11-29 00:58:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 849 transitions. [2023-11-29 00:58:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 00:58:12,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:12,965 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] [2023-11-29 00:58:12,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:13,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:13,166 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:13,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1733308001, now seen corresponding path program 1 times [2023-11-29 00:58:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:13,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260127949] [2023-11-29 00:58:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:13,168 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:13,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:13,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:58:13,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:13,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:13,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260127949] [2023-11-29 00:58:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260127949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:58:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148799817] [2023-11-29 00:58:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:13,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:58:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:58:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:58:13,517 INFO L87 Difference]: Start difference. First operand 810 states and 849 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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) [2023-11-29 00:58:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:14,605 INFO L93 Difference]: Finished difference Result 812 states and 852 transitions. [2023-11-29 00:58:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:58:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2023-11-29 00:58:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:14,613 INFO L225 Difference]: With dead ends: 812 [2023-11-29 00:58:14,613 INFO L226 Difference]: Without dead ends: 812 [2023-11-29 00:58:14,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:14,614 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 1 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:14,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1941 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:58:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2023-11-29 00:58:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2023-11-29 00:58:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 489 states have (on average 1.7280163599182004) internal successors, (845), 807 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:58:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 852 transitions. [2023-11-29 00:58:14,632 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 852 transitions. Word has length 65 [2023-11-29 00:58:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:14,632 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 852 transitions. [2023-11-29 00:58:14,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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) [2023-11-29 00:58:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 852 transitions. [2023-11-29 00:58:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 00:58:14,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:14,633 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] [2023-11-29 00:58:14,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:14,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:14,834 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:14,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 902827578, now seen corresponding path program 1 times [2023-11-29 00:58:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962718129] [2023-11-29 00:58:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:14,836 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:14,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:15,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:58:15,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:15,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:15,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962718129] [2023-11-29 00:58:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962718129] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:15,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 00:58:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954043406] [2023-11-29 00:58:15,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:15,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:58:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:58:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:58:15,203 INFO L87 Difference]: Start difference. First operand 812 states and 852 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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) [2023-11-29 00:58:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:16,437 INFO L93 Difference]: Finished difference Result 821 states and 866 transitions. [2023-11-29 00:58:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:58:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2023-11-29 00:58:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:16,441 INFO L225 Difference]: With dead ends: 821 [2023-11-29 00:58:16,441 INFO L226 Difference]: Without dead ends: 821 [2023-11-29 00:58:16,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:58:16,442 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 7 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:16,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1939 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:58:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2023-11-29 00:58:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 820. [2023-11-29 00:58:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 496 states have (on average 1.7298387096774193) internal successors, (858), 814 states have internal predecessors, (858), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:58:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 865 transitions. [2023-11-29 00:58:16,461 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 865 transitions. Word has length 66 [2023-11-29 00:58:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:16,461 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 865 transitions. [2023-11-29 00:58:16,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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) [2023-11-29 00:58:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 865 transitions. [2023-11-29 00:58:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 00:58:16,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:16,463 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] [2023-11-29 00:58:16,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:16,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:16,663 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:16,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash -130687839, now seen corresponding path program 2 times [2023-11-29 00:58:16,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388891806] [2023-11-29 00:58:16,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:58:16,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:16,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:16,665 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:16,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:17,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:58:17,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:58:17,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:58:17,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:17,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:17,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388891806] [2023-11-29 00:58:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388891806] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:17,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:17,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 00:58:17,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026515317] [2023-11-29 00:58:17,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:17,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:58:17,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:17,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:58:17,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:58:17,369 INFO L87 Difference]: Start difference. First operand 820 states and 865 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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) [2023-11-29 00:58:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:20,257 INFO L93 Difference]: Finished difference Result 835 states and 887 transitions. [2023-11-29 00:58:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:58:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2023-11-29 00:58:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:20,261 INFO L225 Difference]: With dead ends: 835 [2023-11-29 00:58:20,261 INFO L226 Difference]: Without dead ends: 833 [2023-11-29 00:58:20,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:58:20,262 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 13 mSDsluCounter, 4520 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:20,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5167 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 00:58:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-11-29 00:58:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 829. [2023-11-29 00:58:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 505 states have (on average 1.7227722772277227) internal successors, (870), 823 states have internal predecessors, (870), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:58:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 877 transitions. [2023-11-29 00:58:20,277 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 877 transitions. Word has length 69 [2023-11-29 00:58:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:20,278 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 877 transitions. [2023-11-29 00:58:20,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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) [2023-11-29 00:58:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 877 transitions. [2023-11-29 00:58:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 00:58:20,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:20,278 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] [2023-11-29 00:58:20,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:58:20,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:20,479 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:20,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1819887105, now seen corresponding path program 3 times [2023-11-29 00:58:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:20,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100049015] [2023-11-29 00:58:20,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:58:20,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:20,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:20,481 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:20,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:21,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:58:21,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:58:21,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:58:21,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:21,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:22,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:22,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100049015] [2023-11-29 00:58:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100049015] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:22,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 00:58:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970581458] [2023-11-29 00:58:22,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:22,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:58:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:58:22,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:58:22,105 INFO L87 Difference]: Start difference. First operand 829 states and 877 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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) [2023-11-29 00:58:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:28,499 INFO L93 Difference]: Finished difference Result 859 states and 927 transitions. [2023-11-29 00:58:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:58:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2023-11-29 00:58:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:28,504 INFO L225 Difference]: With dead ends: 859 [2023-11-29 00:58:28,504 INFO L226 Difference]: Without dead ends: 856 [2023-11-29 00:58:28,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 00:58:28,506 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 25 mSDsluCounter, 7737 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8383 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:28,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8383 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 00:58:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2023-11-29 00:58:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 847. [2023-11-29 00:58:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 523 states have (on average 1.7074569789674952) internal successors, (893), 841 states have internal predecessors, (893), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:58:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 900 transitions. [2023-11-29 00:58:28,528 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 900 transitions. Word has length 75 [2023-11-29 00:58:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:28,528 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 900 transitions. [2023-11-29 00:58:28,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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) [2023-11-29 00:58:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 900 transitions. [2023-11-29 00:58:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 00:58:28,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:28,529 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] [2023-11-29 00:58:28,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:58:28,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:28,730 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:28,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash -38764351, now seen corresponding path program 4 times [2023-11-29 00:58:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392351596] [2023-11-29 00:58:28,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:58:28,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:28,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:28,732 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:28,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:29,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:58:29,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:58:29,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:58:29,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:29,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:31,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:31,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392351596] [2023-11-29 00:58:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392351596] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:31,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:31,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 00:58:31,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756975022] [2023-11-29 00:58:31,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:31,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 00:58:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 00:58:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:58:31,287 INFO L87 Difference]: Start difference. First operand 847 states and 900 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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) [2023-11-29 00:58:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:45,519 INFO L93 Difference]: Finished difference Result 904 states and 989 transitions. [2023-11-29 00:58:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 00:58:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2023-11-29 00:58:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:45,524 INFO L225 Difference]: With dead ends: 904 [2023-11-29 00:58:45,524 INFO L226 Difference]: Without dead ends: 902 [2023-11-29 00:58:45,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 00:58:45,528 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 48 mSDsluCounter, 16148 mSDsCounter, 0 mSdLazyCounter, 4565 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16795 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:45,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16795 Invalid, 4623 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 4565 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 00:58:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2023-11-29 00:58:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 881. [2023-11-29 00:58:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 557 states have (on average 1.6858168761220826) internal successors, (939), 875 states have internal predecessors, (939), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:58:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 946 transitions. [2023-11-29 00:58:45,550 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 946 transitions. Word has length 87 [2023-11-29 00:58:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:45,551 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 946 transitions. [2023-11-29 00:58:45,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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) [2023-11-29 00:58:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 946 transitions. [2023-11-29 00:58:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 00:58:45,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:45,552 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] [2023-11-29 00:58:45,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:58:45,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:45,753 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:58:45,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1103153953, now seen corresponding path program 5 times [2023-11-29 00:58:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:45,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692703921] [2023-11-29 00:58:45,754 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:58:45,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:45,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:45,755 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:45,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:58:47,008 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:58:47,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:58:47,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 00:58:47,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:47,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:58:47,142 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:58:47,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:58:47,170 INFO L378 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 19 treesize of output 1 [2023-11-29 00:58:47,256 INFO L378 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 [2023-11-29 00:58:48,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:58:48,087 INFO L378 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 44 treesize of output 43 [2023-11-29 00:58:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:58:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:58:48,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:48,568 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2195) |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 [2023-11-29 00:58:48,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:48,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692703921] [2023-11-29 00:58:48,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692703921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:48,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [356635569] [2023-11-29 00:58:48,570 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:58:48,570 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:58:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:58:48,571 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:58:48,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 00:59:49,007 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:59:49,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:59:49,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 00:59:49,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:49,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:59:49,512 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:59:49,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:59:49,571 INFO L378 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 15 treesize of output 1 [2023-11-29 00:59:49,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:59:50,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:50,497 INFO L378 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 35 [2023-11-29 00:59:50,565 INFO L378 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 27 treesize of output 15 [2023-11-29 00:59:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:59:50,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:50,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2658) |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 [2023-11-29 00:59:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [356635569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:50,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:59:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:59:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43494096] [2023-11-29 00:59:50,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:50,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:59:50,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:59:50,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:59:50,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:59:50,958 INFO L87 Difference]: Start difference. First operand 881 states and 946 transitions. Second operand has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:56,013 INFO L93 Difference]: Finished difference Result 1054 states and 1132 transitions. [2023-11-29 00:59:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:59:56,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2023-11-29 00:59:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:56,016 INFO L225 Difference]: With dead ends: 1054 [2023-11-29 00:59:56,016 INFO L226 Difference]: Without dead ends: 1052 [2023-11-29 00:59:56,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2023-11-29 00:59:56,016 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 468 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:56,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 2389 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 00:59:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2023-11-29 00:59:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 880. [2023-11-29 00:59:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 557 states have (on average 1.6768402154398563) internal successors, (934), 874 states have internal predecessors, (934), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:59:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 941 transitions. [2023-11-29 00:59:56,033 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 941 transitions. Word has length 109 [2023-11-29 00:59:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:56,033 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 941 transitions. [2023-11-29 00:59:56,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 941 transitions. [2023-11-29 00:59:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 00:59:56,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:56,034 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] [2023-11-29 00:59:56,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:59:56,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 00:59:56,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:56,435 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 00:59:56,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1103153954, now seen corresponding path program 1 times [2023-11-29 00:59:56,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:59:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541339285] [2023-11-29 00:59:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:56,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:59:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:59:56,437 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:59:56,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 00:59:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:57,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 00:59:57,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:57,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:59:57,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:59:57,234 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:59:57,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:59:57,259 INFO L378 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 19 treesize of output 1 [2023-11-29 00:59:57,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:59:57,361 INFO L378 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 [2023-11-29 00:59:57,365 INFO L378 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 [2023-11-29 00:59:58,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:58,013 INFO L378 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 62 treesize of output 57 [2023-11-29 00:59:58,025 INFO L378 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 30 treesize of output 13 [2023-11-29 00:59:58,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:59:58,071 INFO L378 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 [2023-11-29 00:59:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:59:58,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:59,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3212 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3212 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 00:59:59,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:59:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541339285] [2023-11-29 00:59:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541339285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7141139] [2023-11-29 00:59:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:59,421 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:59,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:59:59,421 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:59:59,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 01:01:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:39,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 01:01:39,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:39,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:01:39,918 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:01:39,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:01:39,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:01:39,973 INFO L378 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 15 treesize of output 1 [2023-11-29 01:01:39,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:01:40,107 INFO L378 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 18 treesize of output 10 [2023-11-29 01:01:40,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:01:40,732 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:40,732 INFO L378 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 50 treesize of output 45 [2023-11-29 01:01:40,739 INFO L378 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 24 treesize of output 11 [2023-11-29 01:01:40,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:01:40,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:01:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:01:40,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:42,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3767 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3767 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 01:01:42,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [7141139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:42,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:01:42,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 01:01:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230840688] [2023-11-29 01:01:42,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:01:42,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:01:42,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:01:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:01:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 01:01:42,063 INFO L87 Difference]: Start difference. First operand 880 states and 941 transitions. Second operand has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:01:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:01:51,673 INFO L93 Difference]: Finished difference Result 1051 states and 1127 transitions. [2023-11-29 01:01:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:01:51,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2023-11-29 01:01:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:01:51,677 INFO L225 Difference]: With dead ends: 1051 [2023-11-29 01:01:51,677 INFO L226 Difference]: Without dead ends: 1051 [2023-11-29 01:01:51,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 01:01:51,678 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 888 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 4931 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 4946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:01:51,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2785 Invalid, 4946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4931 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-11-29 01:01:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2023-11-29 01:01:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 879. [2023-11-29 01:01:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 557 states have (on average 1.675044883303411) internal successors, (933), 873 states have internal predecessors, (933), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:01:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 940 transitions. [2023-11-29 01:01:51,690 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 940 transitions. Word has length 109 [2023-11-29 01:01:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:01:51,691 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 940 transitions. [2023-11-29 01:01:51,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:01:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 940 transitions. [2023-11-29 01:01:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:01:51,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:01:51,692 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] [2023-11-29 01:01:51,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 01:01:51,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:01:52,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:01:52,093 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:01:52,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:52,093 INFO L85 PathProgramCache]: Analyzing trace with hash -724622249, now seen corresponding path program 1 times [2023-11-29 01:01:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:01:52,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684355142] [2023-11-29 01:01:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:52,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:01:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:01:52,095 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:01:52,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:01:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:52,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 01:01:52,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:52,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:01:52,970 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:01:52,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:01:52,994 INFO L378 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 19 treesize of output 1 [2023-11-29 01:01:53,104 INFO L378 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 [2023-11-29 01:01:53,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:53,843 INFO L378 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 44 treesize of output 43 [2023-11-29 01:01:53,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:53,949 INFO L378 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 44 treesize of output 43 [2023-11-29 01:01:53,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:01:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:01:53,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:58,093 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4192 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4192) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:01:58,490 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4238 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4238))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4192)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:01:58,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:01:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684355142] [2023-11-29 01:01:58,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684355142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [987032542] [2023-11-29 01:01:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:01:58,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:01:58,493 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:01:58,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 01:02:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:00,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:02:00,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:00,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:02:00,941 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:02:00,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:02:01,012 INFO L378 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 15 treesize of output 1 [2023-11-29 01:02:01,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:02:02,069 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:02:02,069 INFO L378 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 35 [2023-11-29 01:02:02,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:02:02,235 INFO L378 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 35 [2023-11-29 01:02:02,248 INFO L378 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 27 treesize of output 15 [2023-11-29 01:02:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:02:02,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:02,271 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4663) |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 [2023-11-29 01:02:02,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:02:02,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4709 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4709))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4663)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:02:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [987032542] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:02,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:02:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:02:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049974819] [2023-11-29 01:02:02,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:02:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:02:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=243, Unknown=7, NotChecked=180, Total=506 [2023-11-29 01:02:02,703 INFO L87 Difference]: Start difference. First operand 879 states and 940 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:02:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:02:09,638 INFO L93 Difference]: Finished difference Result 1050 states and 1126 transitions. [2023-11-29 01:02:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:02:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2023-11-29 01:02:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:02:09,641 INFO L225 Difference]: With dead ends: 1050 [2023-11-29 01:02:09,641 INFO L226 Difference]: Without dead ends: 1050 [2023-11-29 01:02:09,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=85, Invalid=270, Unknown=7, NotChecked=190, Total=552 [2023-11-29 01:02:09,641 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 873 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:02:09,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 2612 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2754 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-29 01:02:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2023-11-29 01:02:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 878. [2023-11-29 01:02:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 557 states have (on average 1.6732495511669658) internal successors, (932), 872 states have internal predecessors, (932), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:02:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 939 transitions. [2023-11-29 01:02:09,651 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 939 transitions. Word has length 111 [2023-11-29 01:02:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:02:09,652 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 939 transitions. [2023-11-29 01:02:09,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:02:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 939 transitions. [2023-11-29 01:02:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:02:09,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:02:09,652 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] [2023-11-29 01:02:09,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-11-29 01:02:09,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:10,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:10,053 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:02:10,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -724622248, now seen corresponding path program 1 times [2023-11-29 01:02:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569513064] [2023-11-29 01:02:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:10,055 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:02:10,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 01:02:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:10,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 01:02:10,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:10,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:02:11,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:02:11,019 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:02:11,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:02:11,047 INFO L378 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 19 treesize of output 1 [2023-11-29 01:02:11,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:02:11,149 INFO L378 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 [2023-11-29 01:02:11,154 INFO L378 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 [2023-11-29 01:02:11,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:02:11,811 INFO L378 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 62 treesize of output 57 [2023-11-29 01:02:11,819 INFO L378 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 30 treesize of output 13 [2023-11-29 01:02:11,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:02:11,928 INFO L378 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 62 treesize of output 57 [2023-11-29 01:02:11,938 INFO L378 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 30 treesize of output 13 [2023-11-29 01:02:11,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:02:11,965 INFO L378 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 [2023-11-29 01:02:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:02:11,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:12,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:02:12,190 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:02:13,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5271) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5272))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5271) .cse2 v_ArrVal_5180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:02:13,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569513064] [2023-11-29 01:02:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569513064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:13,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2052390858] [2023-11-29 01:02:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:13,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:02:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:02:13,463 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:02:13,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 01:03:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:56,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 01:03:56,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:03:56,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:03:56,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:03:56,465 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:03:56,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:03:56,526 INFO L378 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 15 treesize of output 1 [2023-11-29 01:03:56,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:03:56,698 INFO L378 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 18 treesize of output 10 [2023-11-29 01:03:56,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:03:57,470 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:03:57,471 INFO L378 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 50 treesize of output 45 [2023-11-29 01:03:57,477 INFO L378 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 24 treesize of output 11 [2023-11-29 01:03:57,686 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:03:57,686 INFO L378 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 50 treesize of output 45 [2023-11-29 01:03:57,696 INFO L378 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 24 treesize of output 11 [2023-11-29 01:03:57,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:03:57,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:03:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:03:57,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:03:57,793 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:03:57,836 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 01:03:59,372 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5835))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5834) .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5834) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 01:03:59,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2052390858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:03:59,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:03:59,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:03:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980468568] [2023-11-29 01:03:59,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:03:59,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:03:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:03:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:03:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 01:03:59,386 INFO L87 Difference]: Start difference. First operand 878 states and 939 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:04:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:04:11,391 INFO L93 Difference]: Finished difference Result 1049 states and 1125 transitions. [2023-11-29 01:04:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:04:11,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2023-11-29 01:04:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:04:11,394 INFO L225 Difference]: With dead ends: 1049 [2023-11-29 01:04:11,394 INFO L226 Difference]: Without dead ends: 1049 [2023-11-29 01:04:11,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 01:04:11,395 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 472 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:04:11,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 2497 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2023-11-29 01:04:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2023-11-29 01:04:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 877. [2023-11-29 01:04:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 557 states have (on average 1.6714542190305206) internal successors, (931), 871 states have internal predecessors, (931), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:04:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 938 transitions. [2023-11-29 01:04:11,410 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 938 transitions. Word has length 111 [2023-11-29 01:04:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:04:11,410 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 938 transitions. [2023-11-29 01:04:11,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:04:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 938 transitions. [2023-11-29 01:04:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:04:11,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:04:11,411 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] [2023-11-29 01:04:11,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:04:11,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 01:04:11,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:04:11,812 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:04:11,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:04:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash -575932887, now seen corresponding path program 1 times [2023-11-29 01:04:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:04:11,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051945136] [2023-11-29 01:04:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:04:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:04:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:04:11,815 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:04:11,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 01:04:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:04:12,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 01:04:12,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:04:12,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:04:13,083 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:04:13,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:04:13,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:04:13,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:04:13,138 INFO L378 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 19 treesize of output 1 [2023-11-29 01:04:13,288 INFO L378 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 [2023-11-29 01:04:13,294 INFO L378 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 [2023-11-29 01:04:14,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:04:14,189 INFO L378 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 62 treesize of output 57 [2023-11-29 01:04:14,197 INFO L378 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 30 treesize of output 13 [2023-11-29 01:04:14,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:04:14,347 INFO L378 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 62 treesize of output 57 [2023-11-29 01:04:14,353 INFO L378 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 30 treesize of output 13 [2023-11-29 01:04:14,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:04:14,462 INFO L378 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 62 treesize of output 57 [2023-11-29 01:04:14,478 INFO L378 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 30 treesize of output 13 [2023-11-29 01:04:14,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:04:14,536 INFO L378 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 [2023-11-29 01:04:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:04:14,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:04:14,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:04:14,808 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:04:14,967 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6320) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6321))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6320) .cse2 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:04:15,124 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6320) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6321))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6320) .cse3 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:04:20,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6415))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6414) .cse1 v_ArrVal_6320) (select (select (store .cse2 .cse1 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6323))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6415))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6321))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6414) .cse4 v_ArrVal_6320) .cse5 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:04:20,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:04:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051945136] [2023-11-29 01:04:20,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051945136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:04:20,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2001646278] [2023-11-29 01:04:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:04:20,311 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:04:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:04:20,312 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:04:20,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 01:04:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:04:51,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:04:51,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:04:51,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:04:51,996 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:04:51,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:04:52,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:04:52,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:04:52,169 INFO L378 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 15 treesize of output 1 [2023-11-29 01:04:52,543 INFO L378 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 18 treesize of output 10 [2023-11-29 01:04:52,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:04:53,922 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:53,923 INFO L378 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 50 treesize of output 45 [2023-11-29 01:04:53,938 INFO L378 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 24 treesize of output 11 [2023-11-29 01:04:54,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:54,301 INFO L378 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 50 treesize of output 45 [2023-11-29 01:04:54,319 INFO L378 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 24 treesize of output 11 [2023-11-29 01:04:54,549 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:54,549 INFO L378 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 50 treesize of output 45 [2023-11-29 01:04:54,559 INFO L378 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 24 treesize of output 11 [2023-11-29 01:04:54,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:04:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:04:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:04:54,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:04:54,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 01:04:54,766 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:04:56,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6900))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6901) .cse1 v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6901) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6900) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 01:04:59,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6995))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6900))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6994) .cse0 v_ArrVal_6901) .cse1 v_ArrVal_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6995))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6994) .cse6 v_ArrVal_6901) (select (select (store .cse7 .cse6 v_ArrVal_6900) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6902))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 01:04:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2001646278] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:04:59,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:04:59,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:04:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129925092] [2023-11-29 01:04:59,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:04:59,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:04:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:04:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:04:59,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=313, Unknown=21, NotChecked=396, Total=812 [2023-11-29 01:04:59,384 INFO L87 Difference]: Start difference. First operand 877 states and 938 transitions. Second operand has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:05:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:21,343 INFO L93 Difference]: Finished difference Result 1048 states and 1124 transitions. [2023-11-29 01:05:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:05:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2023-11-29 01:05:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:21,346 INFO L225 Difference]: With dead ends: 1048 [2023-11-29 01:05:21,346 INFO L226 Difference]: Without dead ends: 1048 [2023-11-29 01:05:21,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=136, Invalid=528, Unknown=22, NotChecked=504, Total=1190 [2023-11-29 01:05:21,347 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 881 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 4911 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 2775 SdHoareTripleChecker+Invalid, 4926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:21,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 2775 Invalid, 4926 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 4911 Invalid, 0 Unknown, 0 Unchecked, 21.1s Time] [2023-11-29 01:05:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-11-29 01:05:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 876. [2023-11-29 01:05:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 557 states have (on average 1.6696588868940754) internal successors, (930), 870 states have internal predecessors, (930), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:05:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 937 transitions. [2023-11-29 01:05:21,366 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 937 transitions. Word has length 113 [2023-11-29 01:05:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:21,366 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 937 transitions. [2023-11-29 01:05:21,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:05:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 937 transitions. [2023-11-29 01:05:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:05:21,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:21,367 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] [2023-11-29 01:05:21,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 01:05:21,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2023-11-29 01:05:21,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:05:21,768 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:05:21,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -575932888, now seen corresponding path program 1 times [2023-11-29 01:05:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821976192] [2023-11-29 01:05:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:21,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:21,770 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:21,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:05:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:22,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:05:22,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:22,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:05:23,133 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:05:23,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:05:23,204 INFO L378 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 19 treesize of output 1 [2023-11-29 01:05:23,393 INFO L378 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 [2023-11-29 01:05:25,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:25,136 INFO L378 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 44 treesize of output 43 [2023-11-29 01:05:25,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:25,360 INFO L378 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 44 treesize of output 43 [2023-11-29 01:05:25,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:25,554 INFO L378 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 44 treesize of output 43 [2023-11-29 01:05:25,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:05:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:05:25,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:05:29,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7435 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:05:29,958 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7435 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7434))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:05:29,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7435 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7434))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:05:30,685 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7435 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7481))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7434)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:05:30,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821976192] [2023-11-29 01:05:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821976192] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:05:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [179305279] [2023-11-29 01:05:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:30,691 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:05:30,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:05:30,692 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:05:30,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 01:05:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:57,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 01:05:57,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:57,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:05:58,380 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:05:58,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:05:58,519 INFO L378 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 15 treesize of output 1 [2023-11-29 01:05:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:06:00,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:06:00,533 INFO L378 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 35 [2023-11-29 01:06:00,916 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:06:00,916 INFO L378 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 35 [2023-11-29 01:06:01,133 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:06:01,133 INFO L378 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 35 [2023-11-29 01:06:01,173 INFO L378 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 27 treesize of output 15 [2023-11-29 01:06:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:06:01,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:01,230 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7922) |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 [2023-11-29 01:06:01,256 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7922 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:06:01,285 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:06:01,319 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:06:01,940 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7968))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7921)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:06:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [179305279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:06:01,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:06:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286307976] [2023-11-29 01:06:01,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:01,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:06:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:01,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:06:01,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=309, Unknown=10, NotChecked=396, Total=812 [2023-11-29 01:06:01,949 INFO L87 Difference]: Start difference. First operand 876 states and 937 transitions. Second operand has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:06:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:18,933 INFO L93 Difference]: Finished difference Result 1047 states and 1123 transitions. [2023-11-29 01:06:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:06:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2023-11-29 01:06:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:18,937 INFO L225 Difference]: With dead ends: 1047 [2023-11-29 01:06:18,937 INFO L226 Difference]: Without dead ends: 1047 [2023-11-29 01:06:18,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=106, Invalid=340, Unknown=10, NotChecked=414, Total=870 [2023-11-29 01:06:18,938 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 454 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 3766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:18,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3543 Invalid, 3766 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2023-11-29 01:06:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-11-29 01:06:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 875. [2023-11-29 01:06:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 557 states have (on average 1.6678635547576302) internal successors, (929), 869 states have internal predecessors, (929), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:06:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 936 transitions. [2023-11-29 01:06:18,949 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 936 transitions. Word has length 113 [2023-11-29 01:06:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:18,950 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 936 transitions. [2023-11-29 01:06:18,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:06:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 936 transitions. [2023-11-29 01:06:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 01:06:18,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:18,951 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] [2023-11-29 01:06:18,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:06:19,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-11-29 01:06:19,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:06:19,352 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:06:19,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 580616723, now seen corresponding path program 1 times [2023-11-29 01:06:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:19,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799210102] [2023-11-29 01:06:19,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:19,354 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:19,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:06:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:20,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 01:06:20,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:20,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:20,963 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:06:20,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:06:21,039 INFO L378 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 19 treesize of output 1 [2023-11-29 01:06:21,262 INFO L378 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 [2023-11-29 01:06:23,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:06:23,029 INFO L378 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 44 treesize of output 43 [2023-11-29 01:06:23,277 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:06:23,277 INFO L378 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 44 treesize of output 43 [2023-11-29 01:06:23,486 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:06:23,486 INFO L378 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 44 treesize of output 43 [2023-11-29 01:06:23,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:06:23,697 INFO L378 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 44 treesize of output 43 [2023-11-29 01:06:23,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:06:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:06:23,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:32,280 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (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$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8423))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:06:32,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8423))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:06:32,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8422 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8422))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8423)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:06:32,371 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8422 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8422))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8423)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:06:33,046 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8422 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8470))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8422)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8423)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:06:33,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799210102] [2023-11-29 01:06:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799210102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:06:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1756591079] [2023-11-29 01:06:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:06:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:06:33,055 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:06:33,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 01:07:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:09,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:07:09,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:09,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:07:10,668 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:07:10,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:07:10,830 INFO L378 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 15 treesize of output 1 [2023-11-29 01:07:11,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:07:12,998 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:12,998 INFO L378 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 35 [2023-11-29 01:07:13,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:13,417 INFO L378 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 35 [2023-11-29 01:07:13,659 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:13,659 INFO L378 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 35 [2023-11-29 01:07:13,922 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:13,923 INFO L378 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 35 [2023-11-29 01:07:13,946 INFO L378 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 27 treesize of output 15 [2023-11-29 01:07:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:07:13,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:07:14,000 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8926) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 01:07:14,024 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:07:14,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (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$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8925))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:07:14,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8925))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:07:14,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8924 (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 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8924))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8925)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:07:14,147 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8924 (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 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8924))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8925)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:07:14,840 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (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 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8972))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8924)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8925)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:07:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1756591079] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:14,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:07:14,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:07:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463014696] [2023-11-29 01:07:14,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:07:14,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:07:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:07:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:07:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=410, Unknown=16, NotChecked=636, Total=1190 [2023-11-29 01:07:14,850 INFO L87 Difference]: Start difference. First operand 875 states and 936 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:07:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:32,606 INFO L93 Difference]: Finished difference Result 1046 states and 1122 transitions. [2023-11-29 01:07:32,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:07:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2023-11-29 01:07:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:32,609 INFO L225 Difference]: With dead ends: 1046 [2023-11-29 01:07:32,609 INFO L226 Difference]: Without dead ends: 1046 [2023-11-29 01:07:32,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=138, Invalid=446, Unknown=16, NotChecked=660, Total=1260 [2023-11-29 01:07:32,610 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 451 mSDsluCounter, 3028 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 3875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:32,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 3462 Invalid, 3875 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2023-11-29 01:07:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-11-29 01:07:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 874. [2023-11-29 01:07:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 557 states have (on average 1.666068222621185) internal successors, (928), 868 states have internal predecessors, (928), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:07:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 935 transitions. [2023-11-29 01:07:32,619 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 935 transitions. Word has length 115 [2023-11-29 01:07:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:32,619 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 935 transitions. [2023-11-29 01:07:32,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:07:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 935 transitions. [2023-11-29 01:07:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 01:07:32,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:32,620 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] [2023-11-29 01:07:32,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:07:32,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2023-11-29 01:07:33,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:07:33,021 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:07:33,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 580616724, now seen corresponding path program 1 times [2023-11-29 01:07:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:07:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193324854] [2023-11-29 01:07:33,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:07:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:07:33,023 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:07:33,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:07:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:07:34,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 01:07:34,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:34,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:07:34,757 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:07:34,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:07:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:07:34,831 INFO L378 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 19 treesize of output 1 [2023-11-29 01:07:34,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:07:35,087 INFO L378 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 [2023-11-29 01:07:35,096 INFO L378 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 [2023-11-29 01:07:36,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:07:36,595 INFO L378 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 62 treesize of output 57 [2023-11-29 01:07:36,606 INFO L378 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 30 treesize of output 13 [2023-11-29 01:07:36,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:07:36,839 INFO L378 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 62 treesize of output 57 [2023-11-29 01:07:36,855 INFO L378 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 30 treesize of output 13 [2023-11-29 01:07:37,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:07:37,038 INFO L378 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 62 treesize of output 57 [2023-11-29 01:07:37,063 INFO L378 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 30 treesize of output 13 [2023-11-29 01:07:37,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:07:37,268 INFO L378 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 62 treesize of output 57 [2023-11-29 01:07:37,288 INFO L378 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 30 treesize of output 13 [2023-11-29 01:07:37,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:07:37,346 INFO L378 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 [2023-11-29 01:07:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:07:37,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:07:37,699 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 01:07:37,745 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:07:37,871 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9474) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9475) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9475))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9474) .cse2 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:07:38,035 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9475))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9474) .cse1 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9474) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9475) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 01:07:39,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9472))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9475))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9473) .cse0 v_ArrVal_9474) .cse1 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9472))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9473) .cse6 v_ArrVal_9474) (select (select (store .cse7 .cse6 v_ArrVal_9475) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9476))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:07:40,865 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9472))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9475))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9473) .cse1 v_ArrVal_9474) .cse2 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9472))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9473) .cse7 v_ArrVal_9474) (select (select (store .cse8 .cse7 v_ArrVal_9475) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9476))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 01:07:46,929 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9569))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9472))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9475))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9568) .cse0 v_ArrVal_9473) .cse1 v_ArrVal_9474) .cse2 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9569))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9472))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9568) .cse8 v_ArrVal_9473) .cse9 v_ArrVal_9474) (select (select (store .cse10 .cse9 v_ArrVal_9475) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9476))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 01:07:46,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:07:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193324854] [2023-11-29 01:07:46,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193324854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [884666495] [2023-11-29 01:07:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:07:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:07:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:07:46,972 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:07:46,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-11-29 01:08:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:26,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 01:08:26,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:08:27,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:08:29,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:08:29,153 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:08:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:08:29,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:08:29,555 INFO L378 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 15 treesize of output 1 [2023-11-29 01:08:30,411 INFO L378 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 18 treesize of output 10 [2023-11-29 01:08:30,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:08:33,947 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:33,947 INFO L378 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 50 treesize of output 45 [2023-11-29 01:08:34,007 INFO L378 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 24 treesize of output 11 [2023-11-29 01:08:34,918 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:34,918 INFO L378 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 50 treesize of output 45 [2023-11-29 01:08:34,977 INFO L378 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 24 treesize of output 11 [2023-11-29 01:08:35,567 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:35,567 INFO L378 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 50 treesize of output 45 [2023-11-29 01:08:35,608 INFO L378 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 24 treesize of output 11 [2023-11-29 01:08:36,277 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:36,278 INFO L378 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 50 treesize of output 45 [2023-11-29 01:08:36,299 INFO L378 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 24 treesize of output 11 [2023-11-29 01:08:36,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:08:36,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:08:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:08:36,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:08:36,603 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:08:36,695 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 01:08:36,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10072))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10071) .cse0 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10071) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 01:08:36,901 WARN L854 $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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10071) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10072))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10071) .cse3 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:08:37,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10069))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10072))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10070) .cse0 v_ArrVal_10071) .cse1 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10069))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10070) .cse6 v_ArrVal_10071) (select (select (store .cse7 .cse6 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10074))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:08:37,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10069))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10070) .cse2 v_ArrVal_10071) (select (select (store .cse3 .cse2 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10074))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10069))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10072))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10070) .cse5 v_ArrVal_10071) .cse6 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:08:44,983 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10165))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10069))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10166) .cse1 v_ArrVal_10070) .cse2 v_ArrVal_10071) (select (select (store .cse3 .cse2 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10074))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10165))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10069))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10072))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10166) .cse6 v_ArrVal_10070) .cse7 v_ArrVal_10071) .cse8 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:08:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [884666495] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:08:45,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:08:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:08:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617011163] [2023-11-29 01:08:45,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:08:45,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:08:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:08:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:08:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 01:08:45,029 INFO L87 Difference]: Start difference. First operand 874 states and 935 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:10:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:12,412 INFO L93 Difference]: Finished difference Result 1045 states and 1121 transitions. [2023-11-29 01:10:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:10:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2023-11-29 01:10:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:12,415 INFO L225 Difference]: With dead ends: 1045 [2023-11-29 01:10:12,415 INFO L226 Difference]: Without dead ends: 1045 [2023-11-29 01:10:12,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 01:10:12,417 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 461 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 5562 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 3192 SdHoareTripleChecker+Invalid, 5570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:12,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 3192 Invalid, 5570 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 5562 Invalid, 0 Unknown, 0 Unchecked, 85.1s Time] [2023-11-29 01:10:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2023-11-29 01:10:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 873. [2023-11-29 01:10:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 557 states have (on average 1.6642728904847397) internal successors, (927), 867 states have internal predecessors, (927), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:10:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 934 transitions. [2023-11-29 01:10:12,426 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 934 transitions. Word has length 115 [2023-11-29 01:10:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:12,426 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 934 transitions. [2023-11-29 01:10:12,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:10:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 934 transitions. [2023-11-29 01:10:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 01:10:12,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:12,427 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] [2023-11-29 01:10:12,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:12,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 01:10:12,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:12,828 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 01:10:12,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -371698694, now seen corresponding path program 1 times [2023-11-29 01:10:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:10:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52640053] [2023-11-29 01:10:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:12,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:12,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:10:12,830 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:10:12,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:10:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:10:14,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:14,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:16,415 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:10:16,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:10:16,645 INFO L378 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 19 treesize of output 1 [2023-11-29 01:10:17,383 INFO L378 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 [2023-11-29 01:10:23,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:23,997 INFO L378 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 44 treesize of output 43 [2023-11-29 01:10:24,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:24,908 INFO L378 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 44 treesize of output 43 [2023-11-29 01:10:25,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:25,585 INFO L378 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 44 treesize of output 43 [2023-11-29 01:10:26,259 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:26,259 INFO L378 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 44 treesize of output 43 [2023-11-29 01:10:26,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:26,984 INFO L378 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 44 treesize of output 43 [2023-11-29 01:10:27,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:10:27,620 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:10:27,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:10:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:27,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:29,368 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:29,475 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10639))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:29,585 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:10:29,695 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10638))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:10:29,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10638))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:29,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10637 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10637))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10638)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:30,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10637 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10637))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10638)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:31,982 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10637 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10687))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10637)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10638)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:32,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:10:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52640053] [2023-11-29 01:10:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52640053] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1820685351] [2023-11-29 01:10:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:32,003 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:10:32,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:10:32,004 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:10:32,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9451c5bc-88b8-467b-b8a0-92c77802f12b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2023-11-29 01:10:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:37,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 01:10:37,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:37,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:40,881 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:10:40,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:10:41,530 INFO L378 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 15 treesize of output 1 [2023-11-29 01:10:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:10:51,590 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:51,591 INFO L378 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 35 [2023-11-29 01:10:53,129 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:53,129 INFO L378 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 35 [2023-11-29 01:10:54,074 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:54,075 INFO L378 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 35 [2023-11-29 01:10:55,101 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:55,101 INFO L378 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 35 [2023-11-29 01:10:56,132 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:56,133 INFO L378 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 35 [2023-11-29 01:10:56,226 INFO L378 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 27 treesize of output 15 [2023-11-29 01:10:56,743 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:10:56,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:10:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:56,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:57,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11162) |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 [2023-11-29 01:10:57,498 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:57,608 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:57,715 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:10:57,826 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_11160 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11160))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:57,940 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_11160 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11160))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:58,061 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_11160 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11159))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11160)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:10:58,184 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10641 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_11160 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10641) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11159))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11160)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 01:11:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1820685351] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:00,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 01:11:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292026149] [2023-11-29 01:11:00,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:00,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:11:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:11:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:11:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=597, Unknown=20, NotChecked=1040, Total=1806 [2023-11-29 01:11:00,756 INFO L87 Difference]: Start difference. First operand 873 states and 934 transitions. Second operand has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)