./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:34:50,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:34:50,719 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 13:34:50,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:34:50,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:34:50,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:34:50,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:34:50,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:34:50,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:34:50,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:34:50,753 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:34:50,753 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:34:50,754 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:34:50,754 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:34:50,755 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:34:50,755 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:34:50,756 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:34:50,756 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:34:50,757 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:34:50,757 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:34:50,758 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:34:50,758 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:34:50,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:34:50,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:34:50,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:34:50,761 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:34:50,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:34:50,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:34:50,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:34:50,762 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:34:50,762 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:34:50,763 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:34:50,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:34:50,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:34:50,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:34:50,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:34:50,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:34:50,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:34:50,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:34:50,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:34:50,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:34:50,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:34:50,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:34:50,766 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:34:50,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:34:50,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:34:50,767 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:34:50,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:34:50,767 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/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_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2023-12-02 13:34:50,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:34:51,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:34:51,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:34:51,020 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:34:51,020 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:34:51,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2023-12-02 13:34:53,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:34:54,091 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:34:54,092 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2023-12-02 13:34:54,113 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data/6a3e1e5b4/f449b560653045739bef4917f7f571db/FLAG703e70e2a [2023-12-02 13:34:54,128 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data/6a3e1e5b4/f449b560653045739bef4917f7f571db [2023-12-02 13:34:54,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:34:54,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:34:54,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:34:54,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:34:54,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:34:54,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:34:54" (1/1) ... [2023-12-02 13:34:54,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541b32c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:54, skipping insertion in model container [2023-12-02 13:34:54,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:34:54" (1/1) ... [2023-12-02 13:34:54,232 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:34:54,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:34:54,946 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-12-02 13:34:54,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1513fe5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:54, skipping insertion in model container [2023-12-02 13:34:54,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:34:54,948 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 13:34:54,949 INFO L158 Benchmark]: Toolchain (without parser) took 816.28ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 115.0MB in the end (delta: -9.4MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2023-12-02 13:34:54,950 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:34:54,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.74ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 115.0MB in the end (delta: -9.4MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2023-12-02 13:34:54,952 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.18ms. Allocated memory is still 107.0MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 813.74ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 115.0MB in the end (delta: -9.4MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:34:56,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:34:56,774 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 13:34:56,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:34:56,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:34:56,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:34:56,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:34:56,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:34:56,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:34:56,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:34:56,807 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:34:56,808 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:34:56,808 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:34:56,809 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:34:56,809 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:34:56,810 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:34:56,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:34:56,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:34:56,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:34:56,812 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:34:56,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:34:56,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:34:56,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:34:56,816 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:34:56,817 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:34:56,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:34:56,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:34:56,818 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:34:56,818 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 13:34:56,819 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 13:34:56,819 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:34:56,820 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:34:56,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:34:56,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:34:56,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 13:34:56,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:34:56,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:34:56,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:34:56,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:34:56,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:34:56,822 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 13:34:56,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 13:34:56,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:34:56,823 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:34:56,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:34:56,823 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/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_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2023-12-02 13:34:57,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:34:57,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:34:57,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:34:57,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:34:57,136 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:34:57,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2023-12-02 13:34:59,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:35:00,311 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:35:00,312 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2023-12-02 13:35:00,333 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data/b3a9a7db4/6462aadda0794d97b70707f8c96234b9/FLAGd70ade846 [2023-12-02 13:35:00,348 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/data/b3a9a7db4/6462aadda0794d97b70707f8c96234b9 [2023-12-02 13:35:00,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:35:00,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:35:00,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:35:00,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:35:00,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:35:00,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:00" (1/1) ... [2023-12-02 13:35:00,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc6b1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00, skipping insertion in model container [2023-12-02 13:35:00,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:00" (1/1) ... [2023-12-02 13:35:00,453 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:35:01,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:01,233 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 13:35:01,256 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:35:01,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:01,379 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:35:01,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:01,542 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:35:01,549 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:35:01,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01 WrapperNode [2023-12-02 13:35:01,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:35:01,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:35:01,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:35:01,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:35:01,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,692 INFO L138 Inliner]: procedures = 180, calls = 783, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3040 [2023-12-02 13:35:01,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:35:01,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:35:01,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:35:01,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:35:01,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:35:01,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:35:01,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:35:01,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:35:01,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (1/1) ... [2023-12-02 13:35:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:35:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:35:01,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:35:01,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:35:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 13:35:01,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 13:35:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 13:35:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 13:35:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 13:35:01,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 13:35:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 13:35:01,921 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 13:35:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:35:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:35:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 13:35:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:35:01,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:35:02,114 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:35:02,116 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:35:02,139 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 13:35:07,811 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:35:07,998 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:35:07,998 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 13:35:07,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:07 BoogieIcfgContainer [2023-12-02 13:35:07,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:35:08,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:35:08,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:35:08,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:35:08,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:35:00" (1/3) ... [2023-12-02 13:35:08,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6a7760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:08, skipping insertion in model container [2023-12-02 13:35:08,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:01" (2/3) ... [2023-12-02 13:35:08,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6a7760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:08, skipping insertion in model container [2023-12-02 13:35:08,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:07" (3/3) ... [2023-12-02 13:35:08,008 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-2.i [2023-12-02 13:35:08,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:35:08,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 535 error locations. [2023-12-02 13:35:08,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:35:08,124 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ea44fd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:35:08,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 535 error locations. [2023-12-02 13:35:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 1974 states, 933 states have (on average 2.2411575562700965) internal successors, (2091), 1967 states have internal predecessors, (2091), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2023-12-02 13:35:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:35:08,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:08,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:35:08,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:08,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 177931, now seen corresponding path program 1 times [2023-12-02 13:35:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093356836] [2023-12-02 13:35:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:08,156 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-12-02 13:35:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:08,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:08,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:08,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:08,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:08,418 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-12-02 13:35:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:08,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:08,433 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093356836] [2023-12-02 13:35:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093356836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:08,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:35:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848150935] [2023-12-02 13:35:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:08,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:08,482 INFO L87 Difference]: Start difference. First operand has 1974 states, 933 states have (on average 2.2411575562700965) internal successors, (2091), 1967 states have internal predecessors, (2091), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-12-02 13:35:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:11,234 INFO L93 Difference]: Finished difference Result 2126 states and 3192 transitions. [2023-12-02 13:35:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:11,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 13:35:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:11,274 INFO L225 Difference]: With dead ends: 2126 [2023-12-02 13:35:11,274 INFO L226 Difference]: Without dead ends: 2125 [2023-12-02 13:35:11,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-02 13:35:11,280 INFO L413 NwaCegarLoop]: 2526 mSDtfsCounter, 1896 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:11,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 2654 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 13:35:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-12-02 13:35:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1960. [2023-12-02 13:35:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 936 states have (on average 2.1474358974358974) internal successors, (2010), 1953 states have internal predecessors, (2010), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 13:35:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 3018 transitions. [2023-12-02 13:35:11,629 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 3018 transitions. Word has length 2 [2023-12-02 13:35:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:11,630 INFO L495 AbstractCegarLoop]: Abstraction has 1960 states and 3018 transitions. [2023-12-02 13:35:11,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-12-02 13:35:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3018 transitions. [2023-12-02 13:35:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:35:11,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:11,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:35:11,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Ended with exit code 0 [2023-12-02 13:35:11,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:11,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:11,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash 177932, now seen corresponding path program 1 times [2023-12-02 13:35:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:11,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187230438] [2023-12-02 13:35:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:11,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-12-02 13:35:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:11,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:11,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:11,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:11,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:11,931 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-12-02 13:35:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:11,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:11,942 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187230438] [2023-12-02 13:35:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187230438] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:35:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131132427] [2023-12-02 13:35:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:11,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:11,946 INFO L87 Difference]: Start difference. First operand 1960 states and 3018 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-12-02 13:35:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:16,335 INFO L93 Difference]: Finished difference Result 3331 states and 5422 transitions. [2023-12-02 13:35:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 13:35:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:16,361 INFO L225 Difference]: With dead ends: 3331 [2023-12-02 13:35:16,361 INFO L226 Difference]: Without dead ends: 3331 [2023-12-02 13:35:16,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-02 13:35:16,363 INFO L413 NwaCegarLoop]: 2840 mSDtfsCounter, 1403 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:16,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 4824 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 13:35:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2023-12-02 13:35:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3062. [2023-12-02 13:35:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 1539 states have (on average 2.0909681611436) internal successors, (3218), 3055 states have internal predecessors, (3218), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 5226 transitions. [2023-12-02 13:35:16,836 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 5226 transitions. Word has length 2 [2023-12-02 13:35:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:16,836 INFO L495 AbstractCegarLoop]: Abstraction has 3062 states and 5226 transitions. [2023-12-02 13:35:16,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-12-02 13:35:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 5226 transitions. [2023-12-02 13:35:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 13:35:16,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:16,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 13:35:16,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:17,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:17,039 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:17,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1114172565, now seen corresponding path program 1 times [2023-12-02 13:35:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10936261] [2023-12-02 13:35:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:17,041 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-12-02 13:35:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:17,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:17,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:17,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:35:17,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:17,184 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-12-02 13:35:17,192 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-12-02 13:35:17,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:35:17,262 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-12-02 13:35:17,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:35:17,285 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-12-02 13:35:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:17,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:17,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10936261] [2023-12-02 13:35:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10936261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:17,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:17,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020803247] [2023-12-02 13:35:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:17,312 INFO L87 Difference]: Start difference. First operand 3062 states and 5226 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:35:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:22,642 INFO L93 Difference]: Finished difference Result 3216 states and 5388 transitions. [2023-12-02 13:35:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 13:35:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:22,668 INFO L225 Difference]: With dead ends: 3216 [2023-12-02 13:35:22,668 INFO L226 Difference]: Without dead ends: 3216 [2023-12-02 13:35:22,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-02 13:35:22,670 INFO L413 NwaCegarLoop]: 2263 mSDtfsCounter, 4025 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:22,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 2324 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-12-02 13:35:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-12-02 13:35:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 1949. [2023-12-02 13:35:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 936 states have (on average 2.1346153846153846) internal successors, (1998), 1942 states have internal predecessors, (1998), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 13:35:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3006 transitions. [2023-12-02 13:35:22,910 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3006 transitions. Word has length 6 [2023-12-02 13:35:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:22,910 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3006 transitions. [2023-12-02 13:35:22,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:35:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3006 transitions. [2023-12-02 13:35:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:35:22,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:22,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:22,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:23,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:23,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:23,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 179611130, now seen corresponding path program 1 times [2023-12-02 13:35:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958139720] [2023-12-02 13:35:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:23,118 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-12-02 13:35:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:23,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:23,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:23,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:23,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:23,216 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-12-02 13:35:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:23,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:23,227 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958139720] [2023-12-02 13:35:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958139720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:23,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:23,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457049438] [2023-12-02 13:35:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:23,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:23,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:23,229 INFO L87 Difference]: Start difference. First operand 1949 states and 3006 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-12-02 13:35:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:26,102 INFO L93 Difference]: Finished difference Result 3092 states and 5171 transitions. [2023-12-02 13:35:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:26,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-12-02 13:35:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:26,119 INFO L225 Difference]: With dead ends: 3092 [2023-12-02 13:35:26,119 INFO L226 Difference]: Without dead ends: 3092 [2023-12-02 13:35:26,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-12-02 13:35:26,120 INFO L413 NwaCegarLoop]: 4628 mSDtfsCounter, 1722 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 6849 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:26,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2225 Valid, 6849 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 13:35:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2023-12-02 13:35:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1902. [2023-12-02 13:35:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 936 states have (on average 2.0844017094017095) internal successors, (1951), 1895 states have internal predecessors, (1951), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 13:35:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2959 transitions. [2023-12-02 13:35:26,361 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2959 transitions. Word has length 7 [2023-12-02 13:35:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:26,361 INFO L495 AbstractCegarLoop]: Abstraction has 1902 states and 2959 transitions. [2023-12-02 13:35:26,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-12-02 13:35:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2959 transitions. [2023-12-02 13:35:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:35:26,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:26,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:26,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-02 13:35:26,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:26,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:26,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 179611131, now seen corresponding path program 1 times [2023-12-02 13:35:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196281254] [2023-12-02 13:35:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:26,565 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-12-02 13:35:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:26,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:26,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:26,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:26,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:26,685 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-12-02 13:35:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:26,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:26,709 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196281254] [2023-12-02 13:35:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196281254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408624697] [2023-12-02 13:35:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:26,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:26,712 INFO L87 Difference]: Start difference. First operand 1902 states and 2959 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-12-02 13:35:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:30,623 INFO L93 Difference]: Finished difference Result 3150 states and 5232 transitions. [2023-12-02 13:35:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-12-02 13:35:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:30,640 INFO L225 Difference]: With dead ends: 3150 [2023-12-02 13:35:30,640 INFO L226 Difference]: Without dead ends: 3150 [2023-12-02 13:35:30,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-12-02 13:35:30,641 INFO L413 NwaCegarLoop]: 4775 mSDtfsCounter, 1440 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 7121 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:30,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 7121 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 13:35:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2023-12-02 13:35:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1915. [2023-12-02 13:35:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 959 states have (on average 2.0834202294056308) internal successors, (1998), 1908 states have internal predecessors, (1998), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 13:35:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 3006 transitions. [2023-12-02 13:35:30,939 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 3006 transitions. Word has length 7 [2023-12-02 13:35:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:30,939 INFO L495 AbstractCegarLoop]: Abstraction has 1915 states and 3006 transitions. [2023-12-02 13:35:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-12-02 13:35:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3006 transitions. [2023-12-02 13:35:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:35:30,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:30,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:30,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:31,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:31,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:31,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1468981190, now seen corresponding path program 1 times [2023-12-02 13:35:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192930904] [2023-12-02 13:35:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:31,142 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-12-02 13:35:31,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:31,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:31,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:31,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:31,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:31,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:31,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192930904] [2023-12-02 13:35:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192930904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:31,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948466390] [2023-12-02 13:35:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:31,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:31,343 INFO L87 Difference]: Start difference. First operand 1915 states and 3006 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-12-02 13:35:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:32,736 INFO L93 Difference]: Finished difference Result 3336 states and 5463 transitions. [2023-12-02 13:35:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-02 13:35:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:32,756 INFO L225 Difference]: With dead ends: 3336 [2023-12-02 13:35:32,756 INFO L226 Difference]: Without dead ends: 3336 [2023-12-02 13:35:32,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-02 13:35:32,757 INFO L413 NwaCegarLoop]: 2882 mSDtfsCounter, 1506 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 5583 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:32,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 5583 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 13:35:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2023-12-02 13:35:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3059. [2023-12-02 13:35:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 1603 states have (on average 2.036805988771054) internal successors, (3265), 3052 states have internal predecessors, (3265), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5273 transitions. [2023-12-02 13:35:32,997 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5273 transitions. Word has length 10 [2023-12-02 13:35:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:32,997 INFO L495 AbstractCegarLoop]: Abstraction has 3059 states and 5273 transitions. [2023-12-02 13:35:32,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-12-02 13:35:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5273 transitions. [2023-12-02 13:35:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:35:32,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:32,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:33,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:33,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:33,199 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:33,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1853929826, now seen corresponding path program 1 times [2023-12-02 13:35:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:33,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365858494] [2023-12-02 13:35:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:33,200 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-12-02 13:35:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:33,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:33,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:33,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:35:33,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:33,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:33,332 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:33,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365858494] [2023-12-02 13:35:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365858494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:33,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:33,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447142010] [2023-12-02 13:35:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:33,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:33,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:33,334 INFO L87 Difference]: Start difference. First operand 3059 states and 5273 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-12-02 13:35:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:34,219 INFO L93 Difference]: Finished difference Result 3005 states and 5193 transitions. [2023-12-02 13:35:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:34,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-12-02 13:35:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:34,235 INFO L225 Difference]: With dead ends: 3005 [2023-12-02 13:35:34,235 INFO L226 Difference]: Without dead ends: 3005 [2023-12-02 13:35:34,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-12-02 13:35:34,235 INFO L413 NwaCegarLoop]: 2785 mSDtfsCounter, 70 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:34,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5521 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 13:35:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2023-12-02 13:35:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3005. [2023-12-02 13:35:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 1573 states have (on average 2.024793388429752) internal successors, (3185), 2998 states have internal predecessors, (3185), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 5193 transitions. [2023-12-02 13:35:34,485 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 5193 transitions. Word has length 12 [2023-12-02 13:35:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:34,485 INFO L495 AbstractCegarLoop]: Abstraction has 3005 states and 5193 transitions. [2023-12-02 13:35:34,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-12-02 13:35:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 5193 transitions. [2023-12-02 13:35:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 13:35:34,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:34,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:34,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 13:35:34,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:34,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr533ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:34,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash -986754248, now seen corresponding path program 1 times [2023-12-02 13:35:34,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:34,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30200577] [2023-12-02 13:35:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:34,691 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-12-02 13:35:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:34,692 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:34,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:34,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:34,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:34,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:35:34,835 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:35:34,835 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:35:34,839 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-12-02 13:35:34,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:35:34,901 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-12-02 13:35:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:34,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:34,916 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30200577] [2023-12-02 13:35:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30200577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:35:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669243418] [2023-12-02 13:35:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:34,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:34,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:34,918 INFO L87 Difference]: Start difference. First operand 3005 states and 5193 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:35:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:38,830 INFO L93 Difference]: Finished difference Result 5296 states and 9516 transitions. [2023-12-02 13:35:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 13:35:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:38,857 INFO L225 Difference]: With dead ends: 5296 [2023-12-02 13:35:38,857 INFO L226 Difference]: Without dead ends: 5296 [2023-12-02 13:35:38,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:35:38,858 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 1308 mSDsluCounter, 5179 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 8116 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:38,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 8116 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 13:35:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2023-12-02 13:35:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 3004. [2023-12-02 13:35:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 1572 states have (on average 2.0248091603053435) internal successors, (3183), 2997 states have internal predecessors, (3183), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 5191 transitions. [2023-12-02 13:35:39,333 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 5191 transitions. Word has length 13 [2023-12-02 13:35:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:39,334 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 5191 transitions. [2023-12-02 13:35:39,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:35:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 5191 transitions. [2023-12-02 13:35:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:35:39,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:39,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:39,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:39,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:39,536 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:39,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1436114350, now seen corresponding path program 1 times [2023-12-02 13:35:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651863406] [2023-12-02 13:35:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:39,538 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-12-02 13:35:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:39,539 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:39,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:39,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:35:39,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:39,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:39,737 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651863406] [2023-12-02 13:35:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651863406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:39,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:39,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337448752] [2023-12-02 13:35:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:39,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:39,739 INFO L87 Difference]: Start difference. First operand 3004 states and 5191 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12-02 13:35:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:40,540 INFO L93 Difference]: Finished difference Result 2950 states and 5111 transitions. [2023-12-02 13:35:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12-02 13:35:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:40,549 INFO L225 Difference]: With dead ends: 2950 [2023-12-02 13:35:40,549 INFO L226 Difference]: Without dead ends: 2950 [2023-12-02 13:35:40,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-12-02 13:35:40,549 INFO L413 NwaCegarLoop]: 2748 mSDtfsCounter, 70 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5447 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:40,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5447 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 13:35:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2023-12-02 13:35:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2950. [2023-12-02 13:35:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 1542 states have (on average 2.0123216601815823) internal successors, (3103), 2943 states have internal predecessors, (3103), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5111 transitions. [2023-12-02 13:35:40,776 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5111 transitions. Word has length 15 [2023-12-02 13:35:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:40,776 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 5111 transitions. [2023-12-02 13:35:40,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12-02 13:35:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5111 transitions. [2023-12-02 13:35:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 13:35:40,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:40,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:40,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:40,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:40,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:40,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1421392629, now seen corresponding path program 1 times [2023-12-02 13:35:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042404453] [2023-12-02 13:35:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:40,984 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-12-02 13:35:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:40,987 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:40,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:41,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:41,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:41,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:41,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:41,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042404453] [2023-12-02 13:35:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042404453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:41,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:41,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:35:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548652615] [2023-12-02 13:35:41,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:41,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:41,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:41,183 INFO L87 Difference]: Start difference. First operand 2950 states and 5111 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-02 13:35:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:42,202 INFO L93 Difference]: Finished difference Result 2936 states and 5069 transitions. [2023-12-02 13:35:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-12-02 13:35:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:42,214 INFO L225 Difference]: With dead ends: 2936 [2023-12-02 13:35:42,214 INFO L226 Difference]: Without dead ends: 2936 [2023-12-02 13:35:42,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-12-02 13:35:42,215 INFO L413 NwaCegarLoop]: 2717 mSDtfsCounter, 58 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 8127 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 8127 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 13:35:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-02 13:35:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2934. [2023-12-02 13:35:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 1540 states have (on average 1.9863636363636363) internal successors, (3059), 2927 states have internal predecessors, (3059), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5067 transitions. [2023-12-02 13:35:42,444 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5067 transitions. Word has length 17 [2023-12-02 13:35:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:42,445 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 5067 transitions. [2023-12-02 13:35:42,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-02 13:35:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5067 transitions. [2023-12-02 13:35:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:35:42,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:42,446 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] [2023-12-02 13:35:42,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-02 13:35:42,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:42,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:42,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1482159641, now seen corresponding path program 1 times [2023-12-02 13:35:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487226310] [2023-12-02 13:35:42,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:42,647 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-12-02 13:35:42,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:42,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:42,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:42,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:42,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:42,818 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-12-02 13:35:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:42,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:42,886 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:42,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487226310] [2023-12-02 13:35:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487226310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:42,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:42,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740514924] [2023-12-02 13:35:42,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:42,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:42,888 INFO L87 Difference]: Start difference. First operand 2934 states and 5067 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:35:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:47,426 INFO L93 Difference]: Finished difference Result 5138 states and 9327 transitions. [2023-12-02 13:35:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:47,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-12-02 13:35:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:47,439 INFO L225 Difference]: With dead ends: 5138 [2023-12-02 13:35:47,439 INFO L226 Difference]: Without dead ends: 5138 [2023-12-02 13:35:47,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-12-02 13:35:47,440 INFO L413 NwaCegarLoop]: 2469 mSDtfsCounter, 1615 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:47,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 5512 Invalid, 2514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 13:35:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2023-12-02 13:35:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 2930. [2023-12-02 13:35:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 1540 states have (on average 1.9811688311688311) internal successors, (3051), 2923 states have internal predecessors, (3051), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 5059 transitions. [2023-12-02 13:35:47,869 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 5059 transitions. Word has length 31 [2023-12-02 13:35:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:47,869 INFO L495 AbstractCegarLoop]: Abstraction has 2930 states and 5059 transitions. [2023-12-02 13:35:47,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:35:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 5059 transitions. [2023-12-02 13:35:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:35:47,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:47,870 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] [2023-12-02 13:35:47,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:48,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:48,071 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:48,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1482159642, now seen corresponding path program 1 times [2023-12-02 13:35:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428284828] [2023-12-02 13:35:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:48,073 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-12-02 13:35:48,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:48,074 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:48,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:48,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:35:48,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:48,234 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-12-02 13:35:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:48,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:48,406 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428284828] [2023-12-02 13:35:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428284828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:48,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:48,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:48,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380857883] [2023-12-02 13:35:48,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:48,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:48,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:48,408 INFO L87 Difference]: Start difference. First operand 2930 states and 5059 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:35:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:54,138 INFO L93 Difference]: Finished difference Result 5179 states and 9333 transitions. [2023-12-02 13:35:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:54,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-12-02 13:35:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:54,149 INFO L225 Difference]: With dead ends: 5179 [2023-12-02 13:35:54,149 INFO L226 Difference]: Without dead ends: 5179 [2023-12-02 13:35:54,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-12-02 13:35:54,150 INFO L413 NwaCegarLoop]: 4802 mSDtfsCounter, 1335 mSDsluCounter, 5788 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 10590 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:54,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 10590 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-02 13:35:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2023-12-02 13:35:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 2926. [2023-12-02 13:35:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 1540 states have (on average 1.975974025974026) internal successors, (3043), 2919 states have internal predecessors, (3043), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5051 transitions. [2023-12-02 13:35:54,521 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5051 transitions. Word has length 31 [2023-12-02 13:35:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:54,521 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 5051 transitions. [2023-12-02 13:35:54,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:35:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5051 transitions. [2023-12-02 13:35:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 13:35:54,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:54,523 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] [2023-12-02 13:35:54,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-02 13:35:54,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:54,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:54,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 901126845, now seen corresponding path program 1 times [2023-12-02 13:35:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:54,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832870756] [2023-12-02 13:35:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:54,728 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-12-02 13:35:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:54,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:54,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:54,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:54,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:55,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:55,035 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832870756] [2023-12-02 13:35:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832870756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:35:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569441638] [2023-12-02 13:35:55,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:55,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:55,038 INFO L87 Difference]: Start difference. First operand 2926 states and 5051 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:35:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:55,925 INFO L93 Difference]: Finished difference Result 2914 states and 5031 transitions. [2023-12-02 13:35:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-02 13:35:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:55,933 INFO L225 Difference]: With dead ends: 2914 [2023-12-02 13:35:55,934 INFO L226 Difference]: Without dead ends: 2914 [2023-12-02 13:35:55,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-12-02 13:35:55,934 INFO L413 NwaCegarLoop]: 2711 mSDtfsCounter, 23 mSDsluCounter, 5402 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:55,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8113 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 13:35:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2023-12-02 13:35:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2914. [2023-12-02 13:35:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 1528 states have (on average 1.9784031413612566) internal successors, (3023), 2907 states have internal predecessors, (3023), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:35:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5031 transitions. [2023-12-02 13:35:56,171 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5031 transitions. Word has length 50 [2023-12-02 13:35:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:56,171 INFO L495 AbstractCegarLoop]: Abstraction has 2914 states and 5031 transitions. [2023-12-02 13:35:56,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:35:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5031 transitions. [2023-12-02 13:35:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 13:35:56,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:56,173 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] [2023-12-02 13:35:56,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:56,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:56,376 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:35:56,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 793308283, now seen corresponding path program 1 times [2023-12-02 13:35:56,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:56,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130900666] [2023-12-02 13:35:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:56,377 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-12-02 13:35:56,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:56,378 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:56,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:35:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:56,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:35:56,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:56,701 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-12-02 13:35:56,709 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-12-02 13:35:57,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:35:57,166 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-12-02 13:35:57,177 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:35:57,177 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-12-02 13:35:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:35:57,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:57,187 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130900666] [2023-12-02 13:35:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130900666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244646530] [2023-12-02 13:35:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:57,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:57,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:57,189 INFO L87 Difference]: Start difference. First operand 2914 states and 5031 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:36:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:02,615 INFO L93 Difference]: Finished difference Result 5084 states and 9261 transitions. [2023-12-02 13:36:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:36:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-02 13:36:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:02,625 INFO L225 Difference]: With dead ends: 5084 [2023-12-02 13:36:02,625 INFO L226 Difference]: Without dead ends: 5084 [2023-12-02 13:36:02,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-12-02 13:36:02,626 INFO L413 NwaCegarLoop]: 2346 mSDtfsCounter, 4201 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5204 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:02,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5204 Valid, 3524 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-02 13:36:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2023-12-02 13:36:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 2853. [2023-12-02 13:36:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1505 states have (on average 1.9455149501661129) internal successors, (2928), 2846 states have internal predecessors, (2928), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:36:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4936 transitions. [2023-12-02 13:36:03,030 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4936 transitions. Word has length 54 [2023-12-02 13:36:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:03,031 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4936 transitions. [2023-12-02 13:36:03,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:36:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4936 transitions. [2023-12-02 13:36:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 13:36:03,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:03,032 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] [2023-12-02 13:36:03,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:03,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:03,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:36:03,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2056646577, now seen corresponding path program 1 times [2023-12-02 13:36:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709322390] [2023-12-02 13:36:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:03,234 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-12-02 13:36:03,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:03,234 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:03,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:03,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:36:03,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:03,506 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-12-02 13:36:03,520 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-12-02 13:36:03,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 23 treesize of output 11 [2023-12-02 13:36:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:03,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:03,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:03,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709322390] [2023-12-02 13:36:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709322390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:03,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:03,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489143224] [2023-12-02 13:36:03,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:03,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:36:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:03,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:36:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:36:03,555 INFO L87 Difference]: Start difference. First operand 2853 states and 4936 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:36:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:06,191 INFO L93 Difference]: Finished difference Result 2852 states and 4935 transitions. [2023-12-02 13:36:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:36:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-02 13:36:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:06,199 INFO L225 Difference]: With dead ends: 2852 [2023-12-02 13:36:06,200 INFO L226 Difference]: Without dead ends: 2852 [2023-12-02 13:36:06,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-12-02 13:36:06,200 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 3 mSDsluCounter, 7102 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9787 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:06,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9787 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 13:36:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-12-02 13:36:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2023-12-02 13:36:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 1505 states have (on average 1.9448504983388704) internal successors, (2927), 2845 states have internal predecessors, (2927), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:36:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4935 transitions. [2023-12-02 13:36:06,487 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4935 transitions. Word has length 58 [2023-12-02 13:36:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:06,488 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 4935 transitions. [2023-12-02 13:36:06,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:36:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4935 transitions. [2023-12-02 13:36:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 13:36:06,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:06,489 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] [2023-12-02 13:36:06,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 13:36:06,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:06,695 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:36:06,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2056646578, now seen corresponding path program 1 times [2023-12-02 13:36:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124777759] [2023-12-02 13:36:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:06,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:36:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:06,698 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:06,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:06,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 13:36:06,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:06,998 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-12-02 13:36:07,019 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-12-02 13:36:07,031 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-12-02 13:36:07,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 21 treesize of output 9 [2023-12-02 13:36:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:07,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:07,084 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124777759] [2023-12-02 13:36:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124777759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719121120] [2023-12-02 13:36:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:07,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:36:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:36:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:36:07,085 INFO L87 Difference]: Start difference. First operand 2852 states and 4935 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:36:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:10,363 INFO L93 Difference]: Finished difference Result 2851 states and 4934 transitions. [2023-12-02 13:36:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:36:10,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-02 13:36:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:10,370 INFO L225 Difference]: With dead ends: 2851 [2023-12-02 13:36:10,370 INFO L226 Difference]: Without dead ends: 2851 [2023-12-02 13:36:10,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-12-02 13:36:10,371 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 1 mSDsluCounter, 7136 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9821 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:10,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9821 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-02 13:36:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2023-12-02 13:36:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2851. [2023-12-02 13:36:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 1504 states have (on average 1.9454787234042554) internal successors, (2926), 2844 states have internal predecessors, (2926), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 13:36:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4934 transitions. [2023-12-02 13:36:10,587 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4934 transitions. Word has length 58 [2023-12-02 13:36:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:10,587 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 4934 transitions. [2023-12-02 13:36:10,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:36:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4934 transitions. [2023-12-02 13:36:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 13:36:10,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:10,588 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] [2023-12-02 13:36:10,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 13:36:10,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:10,789 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:36:10,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash -410114857, now seen corresponding path program 1 times [2023-12-02 13:36:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:10,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036848036] [2023-12-02 13:36:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:10,790 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-12-02 13:36:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:10,791 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:10,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:11,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:36:11,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:11,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:11,083 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:11,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036848036] [2023-12-02 13:36:11,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036848036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:11,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:11,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678516807] [2023-12-02 13:36:11,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:11,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:36:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:11,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:36:11,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:36:11,085 INFO L87 Difference]: Start difference. First operand 2851 states and 4934 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-12-02 13:36:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:12,112 INFO L93 Difference]: Finished difference Result 2853 states and 4937 transitions. [2023-12-02 13:36:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:36:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-12-02 13:36:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:12,124 INFO L225 Difference]: With dead ends: 2853 [2023-12-02 13:36:12,124 INFO L226 Difference]: Without dead ends: 2853 [2023-12-02 13:36:12,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-12-02 13:36:12,125 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 1 mSDsluCounter, 5367 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8052 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:12,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8052 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 13:36:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2023-12-02 13:36:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2023-12-02 13:36:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1505 states have (on average 1.9455149501661129) internal successors, (2928), 2846 states have internal predecessors, (2928), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:36:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4937 transitions. [2023-12-02 13:36:12,366 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4937 transitions. Word has length 64 [2023-12-02 13:36:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:12,366 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4937 transitions. [2023-12-02 13:36:12,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-12-02 13:36:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4937 transitions. [2023-12-02 13:36:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 13:36:12,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:12,367 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-12-02 13:36:12,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-02 13:36:12,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:12,568 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:36:12,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1457343633, now seen corresponding path program 1 times [2023-12-02 13:36:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749999214] [2023-12-02 13:36:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:12,569 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-12-02 13:36:12,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:12,570 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:12,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:12,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:36:12,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:12,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:13,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749999214] [2023-12-02 13:36:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749999214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [575944951] [2023-12-02 13:36:13,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:13,004 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:36:13,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:36:13,005 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:36:13,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 13:36:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:13,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:36:13,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:13,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [575944951] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244445606] [2023-12-02 13:36:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:36:13,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:36:13,517 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:36:13,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 13:36:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:13,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:36:13,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:13,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244445606] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:13,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:36:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 13:36:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876799973] [2023-12-02 13:36:13,837 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:36:13,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:36:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:13,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:36:13,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:36:13,839 INFO L87 Difference]: Start difference. First operand 2853 states and 4937 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-12-02 13:36:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:15,512 INFO L93 Difference]: Finished difference Result 2862 states and 4951 transitions. [2023-12-02 13:36:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:36:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2023-12-02 13:36:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:15,522 INFO L225 Difference]: With dead ends: 2862 [2023-12-02 13:36:15,523 INFO L226 Difference]: Without dead ends: 2862 [2023-12-02 13:36:15,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:36:15,523 INFO L413 NwaCegarLoop]: 2684 mSDtfsCounter, 6 mSDsluCounter, 13411 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16095 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:15,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16095 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 13:36:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2023-12-02 13:36:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2861. [2023-12-02 13:36:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 1512 states have (on average 1.94510582010582) internal successors, (2941), 2853 states have internal predecessors, (2941), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:36:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4950 transitions. [2023-12-02 13:36:15,850 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4950 transitions. Word has length 65 [2023-12-02 13:36:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:15,851 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4950 transitions. [2023-12-02 13:36:15,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-12-02 13:36:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4950 transitions. [2023-12-02 13:36:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-02 13:36:15,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:15,852 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] [2023-12-02 13:36:15,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-02 13:36:16,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 13:36:16,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 13:36:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 13:36:16,453 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:36:16,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -705215657, now seen corresponding path program 2 times [2023-12-02 13:36:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417427188] [2023-12-02 13:36:16,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:36:16,454 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-12-02 13:36:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:16,455 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:16,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:36:16,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:36:16,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:36:16,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:36:16,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:16,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:17,095 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417427188] [2023-12-02 13:36:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417427188] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2051486105] [2023-12-02 13:36:17,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:36:17,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:36:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:36:17,097 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:36:17,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 13:36:18,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:36:18,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:36:18,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:36:18,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:18,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:36:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2051486105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097460852] [2023-12-02 13:36:18,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:36:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:36:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:36:18,682 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:36:18,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 13:36:47,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:36:47,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:36:47,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 13:36:47,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:47,243 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:36:47,243 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-12-02 13:36:47,268 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-12-02 13:36:47,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:36:47,494 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-12-02 13:36:47,554 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-12-02 13:36:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:36:47,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:47,676 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:36:47,676 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 25 treesize of output 24 [2023-12-02 13:36:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097460852] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:36:47,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:36:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 13:36:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903786901] [2023-12-02 13:36:47,779 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:36:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 13:36:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 13:36:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=550, Unknown=9, NotChecked=0, Total=650 [2023-12-02 13:36:47,782 INFO L87 Difference]: Start difference. First operand 2861 states and 4950 transitions. Second operand has 24 states, 21 states have (on average 5.904761904761905) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 13:37:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:37:13,714 INFO L93 Difference]: Finished difference Result 5083 states and 9239 transitions. [2023-12-02 13:37:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 13:37:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.904761904761905) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2023-12-02 13:37:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:37:13,736 INFO L225 Difference]: With dead ends: 5083 [2023-12-02 13:37:13,736 INFO L226 Difference]: Without dead ends: 5081 [2023-12-02 13:37:13,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=2500, Unknown=12, NotChecked=0, Total=2970 [2023-12-02 13:37:13,738 INFO L413 NwaCegarLoop]: 2451 mSDtfsCounter, 1569 mSDsluCounter, 31887 mSDsCounter, 0 mSdLazyCounter, 18402 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 34338 SdHoareTripleChecker+Invalid, 19424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 18402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:37:13,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 34338 Invalid, 19424 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1022 Valid, 18402 Invalid, 0 Unknown, 0 Unchecked, 24.5s Time] [2023-12-02 13:37:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2023-12-02 13:37:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 2869. [2023-12-02 13:37:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 1521 states have (on average 1.9408284023668638) internal successors, (2952), 2861 states have internal predecessors, (2952), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:37:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4961 transitions. [2023-12-02 13:37:14,469 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4961 transitions. Word has length 68 [2023-12-02 13:37:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:37:14,470 INFO L495 AbstractCegarLoop]: Abstraction has 2869 states and 4961 transitions. [2023-12-02 13:37:14,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.904761904761905) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 13:37:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4961 transitions. [2023-12-02 13:37:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-02 13:37:14,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:37:14,471 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] [2023-12-02 13:37:14,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-02 13:37:14,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 13:37:14,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Ended with exit code 0 [2023-12-02 13:37:15,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:37:15,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:37:15,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:37:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -205072104, now seen corresponding path program 1 times [2023-12-02 13:37:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:37:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609670520] [2023-12-02 13:37:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:37:15,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:37:15,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:37:15,075 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:37:15,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:37:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:37:15,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 13:37:15,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:15,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:15,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:37:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609670520] [2023-12-02 13:37:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609670520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1472761226] [2023-12-02 13:37:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:37:15,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:37:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:37:15,939 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:37:15,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 13:37:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:37:16,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 13:37:16,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:16,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1472761226] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499777598] [2023-12-02 13:37:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:37:16,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:37:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:37:16,670 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:37:16,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 13:37:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:37:16,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 13:37:16,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:17,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499777598] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:17,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:37:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 13:37:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309639007] [2023-12-02 13:37:17,708 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:37:17,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 13:37:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:37:17,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 13:37:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 13:37:17,711 INFO L87 Difference]: Start difference. First operand 2869 states and 4961 transitions. Second operand has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 13:37:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:37:23,028 INFO L93 Difference]: Finished difference Result 2899 states and 5006 transitions. [2023-12-02 13:37:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 13:37:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2023-12-02 13:37:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:37:23,034 INFO L225 Difference]: With dead ends: 2899 [2023-12-02 13:37:23,034 INFO L226 Difference]: Without dead ends: 2896 [2023-12-02 13:37:23,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 13:37:23,036 INFO L413 NwaCegarLoop]: 2682 mSDtfsCounter, 27 mSDsluCounter, 29491 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32173 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:37:23,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32173 Invalid, 1839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 13:37:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2023-12-02 13:37:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2887. [2023-12-02 13:37:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 1539 states have (on average 1.9330734243014944) internal successors, (2975), 2879 states have internal predecessors, (2975), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:37:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4984 transitions. [2023-12-02 13:37:23,398 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4984 transitions. Word has length 74 [2023-12-02 13:37:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:37:23,398 INFO L495 AbstractCegarLoop]: Abstraction has 2887 states and 4984 transitions. [2023-12-02 13:37:23,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 13:37:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4984 transitions. [2023-12-02 13:37:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 13:37:23,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:37:23,399 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] [2023-12-02 13:37:23,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:37:23,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 13:37:23,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 13:37:24,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:37:24,000 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:37:24,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:37:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash -337898344, now seen corresponding path program 2 times [2023-12-02 13:37:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:37:24,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003860275] [2023-12-02 13:37:24,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:37:24,002 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-12-02 13:37:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:37:24,002 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:37:24,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:37:24,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:24,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:24,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 13:37:24,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:25,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:27,244 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:37:27,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003860275] [2023-12-02 13:37:27,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003860275] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [94560911] [2023-12-02 13:37:27,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:37:27,245 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:37:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:37:27,246 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:37:27,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 13:37:28,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:28,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:28,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 13:37:28,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:28,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:37:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [94560911] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905949679] [2023-12-02 13:37:29,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:37:29,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:37:29,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:37:29,481 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:37:29,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 13:37:53,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:53,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:53,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:37:53,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:53,377 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:37:53,377 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-12-02 13:37:53,383 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-12-02 13:37:53,493 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-12-02 13:37:53,503 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-12-02 13:37:53,836 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-12-02 13:37:53,841 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-12-02 13:37:54,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:37:54,416 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-12-02 13:37:54,428 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-12-02 13:37:54,613 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-12-02 13:37:54,618 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-12-02 13:37:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 13:37:54,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:55,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 13:37:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905949679] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:37:55,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:37:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 13:37:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054019086] [2023-12-02 13:37:55,598 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:37:55,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 13:37:55,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:37:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 13:37:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 13:37:55,601 INFO L87 Difference]: Start difference. First operand 2887 states and 4984 transitions. Second operand has 58 states, 55 states have (on average 2.909090909090909) internal successors, (160), 58 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 13:38:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:38:38,459 INFO L93 Difference]: Finished difference Result 5157 states and 9354 transitions. [2023-12-02 13:38:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-02 13:38:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.909090909090909) internal successors, (160), 58 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2023-12-02 13:38:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:38:38,469 INFO L225 Difference]: With dead ends: 5157 [2023-12-02 13:38:38,469 INFO L226 Difference]: Without dead ends: 5150 [2023-12-02 13:38:38,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 371 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3826 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3457, Invalid=16568, Unknown=1, NotChecked=280, Total=20306 [2023-12-02 13:38:38,475 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 1599 mSDsluCounter, 69360 mSDsCounter, 0 mSdLazyCounter, 17137 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 71818 SdHoareTripleChecker+Invalid, 17223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 17137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:38:38,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 71818 Invalid, 17223 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [86 Valid, 17137 Invalid, 0 Unknown, 0 Unchecked, 31.4s Time] [2023-12-02 13:38:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2023-12-02 13:38:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 2922. [2023-12-02 13:38:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 1575 states have (on average 1.9161904761904762) internal successors, (3018), 2914 states have internal predecessors, (3018), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:38:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 5027 transitions. [2023-12-02 13:38:39,271 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 5027 transitions. Word has length 86 [2023-12-02 13:38:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:38:39,271 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 5027 transitions. [2023-12-02 13:38:39,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.909090909090909) internal successors, (160), 58 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 13:38:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 5027 transitions. [2023-12-02 13:38:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 13:38:39,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:38:39,273 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:38:39,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:38:39,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 13:38:39,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 13:38:39,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:38:39,874 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:38:39,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:38:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash -823962797, now seen corresponding path program 1 times [2023-12-02 13:38:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:38:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179262206] [2023-12-02 13:38:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:39,876 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-12-02 13:38:39,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:38:39,877 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:38:39,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-02 13:38:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:40,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 13:38:40,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:40,615 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-12-02 13:38:40,724 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:38:40,724 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-12-02 13:38:40,751 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-12-02 13:38:40,840 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-12-02 13:38:41,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:41,742 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-12-02 13:38:41,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:41,840 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-12-02 13:38:41,854 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-12-02 13:38:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:38:41,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:41,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_3345) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-12-02 13:38:41,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3345) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:38:42,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3391))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:38:42,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:38:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179262206] [2023-12-02 13:38:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179262206] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [966814273] [2023-12-02 13:38:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:42,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:38:42,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:38:42,340 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:38:42,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 13:38:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:44,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:38:44,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:44,553 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-12-02 13:38:44,785 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:38:44,785 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-12-02 13:38:44,826 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-12-02 13:38:44,940 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-12-02 13:38:45,726 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:38:45,726 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-12-02 13:38:45,873 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:38:45,873 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-12-02 13:38:45,886 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-12-02 13:38:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:38:45,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:47,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3815 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 13:38:48,342 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3861))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3815)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:38:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [966814273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62136968] [2023-12-02 13:38:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:48,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:38:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:38:48,345 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:38:48,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 13:38:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:48,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 13:38:48,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:48,972 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:38:48,972 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-12-02 13:38:49,004 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-12-02 13:38:49,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:49,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 44 treesize of output 43 [2023-12-02 13:38:49,824 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:49,824 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-12-02 13:38:49,837 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-12-02 13:38:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:38:49,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:52,322 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 13:38:52,323 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 37 treesize of output 36 [2023-12-02 13:38:52,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3815)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2023-12-02 13:38:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62136968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:52,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:38:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 23 [2023-12-02 13:38:52,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947245053] [2023-12-02 13:38:52,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:38:52,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 13:38:52,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:38:52,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 13:38:52,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=541, Unknown=11, NotChecked=318, Total=992 [2023-12-02 13:38:52,337 INFO L87 Difference]: Start difference. First operand 2922 states and 5027 transitions. Second operand has 24 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:39:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:39:19,956 INFO L93 Difference]: Finished difference Result 5130 states and 9295 transitions. [2023-12-02 13:39:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:39:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 110 [2023-12-02 13:39:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:39:19,969 INFO L225 Difference]: With dead ends: 5130 [2023-12-02 13:39:19,969 INFO L226 Difference]: Without dead ends: 5130 [2023-12-02 13:39:19,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=145, Invalid=680, Unknown=11, NotChecked=354, Total=1190 [2023-12-02 13:39:19,971 INFO L413 NwaCegarLoop]: 2450 mSDtfsCounter, 2957 mSDsluCounter, 19004 mSDsCounter, 0 mSdLazyCounter, 15147 mSolverCounterSat, 1518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3460 SdHoareTripleChecker+Valid, 21454 SdHoareTripleChecker+Invalid, 16665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1518 IncrementalHoareTripleChecker+Valid, 15147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:39:19,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3460 Valid, 21454 Invalid, 16665 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1518 Valid, 15147 Invalid, 0 Unknown, 0 Unchecked, 27.1s Time] [2023-12-02 13:39:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2023-12-02 13:39:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 2921. [2023-12-02 13:39:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 1575 states have (on average 1.9155555555555555) internal successors, (3017), 2913 states have internal predecessors, (3017), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:39:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 5026 transitions. [2023-12-02 13:39:20,701 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 5026 transitions. Word has length 110 [2023-12-02 13:39:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:39:20,702 INFO L495 AbstractCegarLoop]: Abstraction has 2921 states and 5026 transitions. [2023-12-02 13:39:20,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:39:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 5026 transitions. [2023-12-02 13:39:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 13:39:20,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:39:20,703 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] [2023-12-02 13:39:20,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-02 13:39:20,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 13:39:21,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 13:39:21,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:39:21,304 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:39:21,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:39:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash -823962796, now seen corresponding path program 1 times [2023-12-02 13:39:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:39:21,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419476991] [2023-12-02 13:39:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:39:21,307 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-12-02 13:39:21,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:39:21,308 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:39:21,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:39:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:39:22,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 13:39:22,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:39:22,112 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-12-02 13:39:22,375 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-12-02 13:39:22,390 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:39:22,391 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-12-02 13:39:22,425 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-12-02 13:39:22,433 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-12-02 13:39:22,545 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-12-02 13:39:22,550 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-12-02 13:39:23,259 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:39:23,260 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-12-02 13:39:23,270 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-12-02 13:39:23,377 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:39:23,377 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-12-02 13:39:23,388 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-12-02 13:39:23,401 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-12-02 13:39:23,408 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-12-02 13:39:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:39:23,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:39:23,592 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:39:23,627 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 13:39:24,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4890))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4891) .cse0 v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4891) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 13:39:24,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:39:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419476991] [2023-12-02 13:39:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419476991] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:39:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [107410433] [2023-12-02 13:39:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:39:24,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:39:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:39:24,968 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:39:24,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 13:41:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:20,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 13:41:20,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:20,464 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-12-02 13:41:20,702 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-12-02 13:41:20,717 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:41:20,718 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-12-02 13:41:20,728 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-12-02 13:41:20,739 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-12-02 13:41:20,795 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-12-02 13:41:20,799 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-12-02 13:41:21,422 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:41:21,422 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-12-02 13:41:21,433 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-12-02 13:41:21,501 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:41:21,501 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-12-02 13:41:21,511 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-12-02 13:41:21,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 25 treesize of output 13 [2023-12-02 13:41:21,533 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-12-02 13:41:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:41:21,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:21,588 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 13:41:21,627 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:41:22,962 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5452))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5453) .cse0 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5453) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 13:41:22,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [107410433] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994527178] [2023-12-02 13:41:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:22,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:41:22,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:41:22,972 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:41:22,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 13:41:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:23,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-02 13:41:23,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:23,679 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-12-02 13:41:23,693 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:41:23,693 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-12-02 13:41:23,751 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-12-02 13:41:23,759 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-12-02 13:41:23,910 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-12-02 13:41:23,914 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-12-02 13:41:24,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:41:24,520 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-12-02 13:41:24,529 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-12-02 13:41:24,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:41:24,684 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-12-02 13:41:24,693 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-12-02 13:41:24,709 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-12-02 13:41:24,716 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-12-02 13:41:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:41:24,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:24,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 13:41:24,814 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:41:26,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6013))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6014) .cse0 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6014) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 13:41:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994527178] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:26,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:41:26,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 13:41:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275860941] [2023-12-02 13:41:26,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:41:26,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 13:41:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:41:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 13:41:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 13:41:26,086 INFO L87 Difference]: Start difference. First operand 2921 states and 5026 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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-12-02 13:41:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:41:41,742 INFO L93 Difference]: Finished difference Result 5128 states and 9293 transitions. [2023-12-02 13:41:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:41:41,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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 110 [2023-12-02 13:41:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:41:41,754 INFO L225 Difference]: With dead ends: 5128 [2023-12-02 13:41:41,754 INFO L226 Difference]: Without dead ends: 5128 [2023-12-02 13:41:41,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 13:41:41,755 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2962 mSDsluCounter, 14484 mSDsCounter, 0 mSdLazyCounter, 7727 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 16942 SdHoareTripleChecker+Invalid, 8243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 7727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:41:41,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 16942 Invalid, 8243 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 7727 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2023-12-02 13:41:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2023-12-02 13:41:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 2920. [2023-12-02 13:41:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 1575 states have (on average 1.914920634920635) internal successors, (3016), 2912 states have internal predecessors, (3016), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:41:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 5025 transitions. [2023-12-02 13:41:42,480 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 5025 transitions. Word has length 110 [2023-12-02 13:41:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:41:42,481 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 5025 transitions. [2023-12-02 13:41:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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-12-02 13:41:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 5025 transitions. [2023-12-02 13:41:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:41:42,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:41:42,482 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] [2023-12-02 13:41:42,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-12-02 13:41:42,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 13:41:42,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:41:43,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:41:43,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:41:43,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:41:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1549069974, now seen corresponding path program 1 times [2023-12-02 13:41:43,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:41:43,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526140224] [2023-12-02 13:41:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:41:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:41:43,088 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:41:43,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-02 13:41:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:43,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 13:41:43,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:43,960 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-12-02 13:41:44,084 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:41:44,085 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-12-02 13:41:44,121 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-12-02 13:41:44,206 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-12-02 13:41:45,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:41:45,093 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-12-02 13:41:45,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:41:45,213 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-12-02 13:41:45,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:41:45,300 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-12-02 13:41:45,313 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-12-02 13:41:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:41:45,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:47,465 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:41:47,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6453))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6454)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:41:47,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6453))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6454)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:41:47,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6500))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6453)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6454)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:41:47,890 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:41:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526140224] [2023-12-02 13:41:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526140224] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1568259313] [2023-12-02 13:41:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:47,890 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:41:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:41:47,891 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:41:47,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 13:42:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:35,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 13:42:35,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:35,862 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-12-02 13:42:36,127 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:42:36,127 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-12-02 13:42:36,214 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-12-02 13:42:36,218 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-12-02 13:42:36,397 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-12-02 13:42:36,402 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-12-02 13:42:37,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:42:37,532 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 52 treesize of output 47 [2023-12-02 13:42:37,540 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-12-02 13:42:37,741 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:42:37,741 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 52 treesize of output 47 [2023-12-02 13:42:37,750 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-12-02 13:42:37,772 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 7 treesize of output 3 [2023-12-02 13:42:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2023-12-02 13:42:37,929 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-12-02 13:42:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:42:37,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:38,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse3 (bvadd |c_ULTIMATE.start_main_#t~mem41#1.offset| (_ bv7 32)))) (store (let ((.cse2 (bvadd |c_ULTIMATE.start_main_#t~mem41#1.offset| (_ bv6 32)))) (store (let ((.cse1 (bvadd |c_ULTIMATE.start_main_#t~mem41#1.offset| (_ bv5 32)))) (store (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem41#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base|) .cse0 (select v_ArrVal_6987 .cse0))) .cse1 (select v_ArrVal_6987 .cse1))) .cse2 (select v_ArrVal_6987 .cse2))) .cse3 (select v_ArrVal_6987 .cse3))) v_ArrVal_6987)) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6987) |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-12-02 13:42:38,117 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= v_ArrVal_6987 (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (bvadd .cse3 (_ bv7 32)))) (store (let ((.cse5 (bvadd .cse3 (_ bv6 32)))) (store (let ((.cse4 (bvadd .cse3 (_ bv5 32)))) (store (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse2 (select v_ArrVal_6987 .cse2))) .cse4 (select v_ArrVal_6987 .cse4))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6)))))))))) is different from false [2023-12-02 13:42:38,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6985)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (_ bv1 1)) (_ bv0 1)) (not (= (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (bvadd .cse4 (_ bv7 32)))) (store (let ((.cse6 (bvadd (_ bv6 32) .cse4))) (store (let ((.cse5 (bvadd .cse4 (_ bv5 32)))) (store (let ((.cse3 (bvadd (_ bv4 32) .cse4))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_6987 .cse3))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6))) .cse7 (select v_ArrVal_6987 .cse7)))) v_ArrVal_6987)))))) is different from false [2023-12-02 13:42:38,302 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6985))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (_ bv1 1)) (_ bv0 1)) (not (= (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (bvadd (_ bv7 32) .cse4))) (store (let ((.cse6 (bvadd (_ bv6 32) .cse4))) (store (let ((.cse5 (bvadd (_ bv5 32) .cse4))) (store (let ((.cse3 (bvadd (_ bv4 32) .cse4))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_6987 .cse3))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6))) .cse7 (select v_ArrVal_6987 .cse7)))) v_ArrVal_6987)))))))) is different from false [2023-12-02 13:42:39,634 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7080)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse0 (store .cse9 .cse7 v_ArrVal_6985))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (or (not (= v_ArrVal_6987 (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7081) .cse7 v_ArrVal_6984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse6 (bvadd .cse3 (_ bv7 32)))) (store (let ((.cse5 (bvadd (_ bv6 32) .cse3))) (store (let ((.cse4 (bvadd .cse3 (_ bv5 32)))) (store (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_6987 .cse2))) .cse4 (select v_ArrVal_6987 .cse4))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6)))))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (_ bv0 1)))))))) is different from false [2023-12-02 13:42:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1568259313] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94838356] [2023-12-02 13:42:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:39,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:39,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:39,676 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:42:39,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 13:42:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:40,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 13:42:40,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:40,338 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-12-02 13:42:40,447 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:42:40,448 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-12-02 13:42:40,486 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-12-02 13:42:40,881 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:40,881 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 31 treesize of output 32 [2023-12-02 13:42:40,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:40,980 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 31 treesize of output 32 [2023-12-02 13:42:41,075 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:41,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 44 treesize of output 43 [2023-12-02 13:42:41,146 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-12-02 13:42:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:42:41,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:41,173 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:42:41,173 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 25 treesize of output 24 [2023-12-02 13:42:41,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem41#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 13:42:41,190 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 13:42:41,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7519)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 13:42:41,214 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7519))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 13:42:41,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7566))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7519)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 13:42:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94838356] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:41,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:42:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2023-12-02 13:42:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823070630] [2023-12-02 13:42:41,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:42:41,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 13:42:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:42:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 13:42:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=791, Unknown=17, NotChecked=994, Total=1980 [2023-12-02 13:42:41,570 INFO L87 Difference]: Start difference. First operand 2920 states and 5025 transitions. Second operand has 29 states, 25 states have (on average 5.92) internal successors, (148), 29 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:43:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:19,019 INFO L93 Difference]: Finished difference Result 5128 states and 9293 transitions. [2023-12-02 13:43:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:43:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.92) internal successors, (148), 29 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 112 [2023-12-02 13:43:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:19,027 INFO L225 Difference]: With dead ends: 5128 [2023-12-02 13:43:19,027 INFO L226 Difference]: Without dead ends: 5128 [2023-12-02 13:43:19,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 312 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=204, Invalid=891, Unknown=17, NotChecked=1050, Total=2162 [2023-12-02 13:43:19,028 INFO L413 NwaCegarLoop]: 2450 mSDtfsCounter, 2953 mSDsluCounter, 19251 mSDsCounter, 0 mSdLazyCounter, 15850 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 21701 SdHoareTripleChecker+Invalid, 17367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 15850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:19,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 21701 Invalid, 17367 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1517 Valid, 15850 Invalid, 0 Unknown, 0 Unchecked, 36.9s Time] [2023-12-02 13:43:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2023-12-02 13:43:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 2919. [2023-12-02 13:43:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 1575 states have (on average 1.9142857142857144) internal successors, (3015), 2911 states have internal predecessors, (3015), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:43:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 5024 transitions. [2023-12-02 13:43:19,716 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 5024 transitions. Word has length 112 [2023-12-02 13:43:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:19,717 INFO L495 AbstractCegarLoop]: Abstraction has 2919 states and 5024 transitions. [2023-12-02 13:43:19,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.92) internal successors, (148), 29 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:43:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 5024 transitions. [2023-12-02 13:43:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:43:19,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:19,718 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] [2023-12-02 13:43:19,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-12-02 13:43:19,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-02 13:43:20,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-12-02 13:43:20,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:43:20,319 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:43:20,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1549069973, now seen corresponding path program 1 times [2023-12-02 13:43:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:43:20,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372193127] [2023-12-02 13:43:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:20,320 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-12-02 13:43:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:43:20,321 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:43:20,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:43:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:21,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 13:43:21,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:43:21,260 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-12-02 13:43:21,470 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-12-02 13:43:21,485 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:43:21,485 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-12-02 13:43:21,534 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-12-02 13:43:21,546 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-12-02 13:43:21,652 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-12-02 13:43:21,656 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-12-02 13:43:22,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:43:22,284 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-12-02 13:43:22,289 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-12-02 13:43:22,390 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:43:22,391 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-12-02 13:43:22,399 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-12-02 13:43:22,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:43:22,494 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-12-02 13:43:22,503 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-12-02 13:43:22,517 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-12-02 13:43:22,522 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-12-02 13:43:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:43:22,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:43:22,700 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:43:22,733 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 13:43:22,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8050))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8051) .cse0 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8051) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 13:43:22,967 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8051) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8050))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8051) .cse3 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:43:25,432 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8145 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8145))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8050))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8144) .cse0 v_ArrVal_8051) .cse1 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8145 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8145))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8144) .cse6 v_ArrVal_8051) (select (select (store .cse7 .cse6 v_ArrVal_8050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8052))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 13:43:25,444 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:43:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372193127] [2023-12-02 13:43:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372193127] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:43:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1874267142] [2023-12-02 13:43:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:25,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:43:25,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:43:25,445 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:43:25,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 13:44:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:19,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 13:44:19,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:19,302 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-12-02 13:44:19,810 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:44:19,810 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-12-02 13:44:19,827 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-12-02 13:44:19,869 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-12-02 13:44:19,876 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-12-02 13:44:19,964 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-12-02 13:44:19,971 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-12-02 13:44:20,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:44:20,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 50 treesize of output 45 [2023-12-02 13:44:21,004 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-12-02 13:44:21,129 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:44:21,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 50 treesize of output 45 [2023-12-02 13:44:21,136 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-12-02 13:44:21,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:44:21,214 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-12-02 13:44:21,221 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-12-02 13:44:21,247 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-12-02 13:44:21,254 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-12-02 13:44:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:44:21,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:44:21,323 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:44:21,377 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 13:44:21,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8629) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8630))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8629) .cse2 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:44:21,627 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8629) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8630))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8629) .cse3 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:44:23,561 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8724))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8723) .cse1 v_ArrVal_8629) (select (select (store .cse2 .cse1 v_ArrVal_8630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8632))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8724))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8630))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8723) .cse4 v_ArrVal_8629) .cse5 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:44:23,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1874267142] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:44:23,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283719964] [2023-12-02 13:44:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:23,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:44:23,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:44:23,583 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:44:23,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 13:44:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:24,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 13:44:24,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:24,295 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-12-02 13:44:24,569 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-12-02 13:44:24,594 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:44:24,594 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-12-02 13:44:24,694 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-12-02 13:44:24,702 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-12-02 13:44:24,943 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-12-02 13:44:24,950 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-12-02 13:44:26,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:44:26,054 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-12-02 13:44:26,076 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-12-02 13:44:26,343 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:44:26,343 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-12-02 13:44:26,352 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-12-02 13:44:26,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:44:26,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 62 treesize of output 57 [2023-12-02 13:44:26,551 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-12-02 13:44:26,572 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-12-02 13:44:26,583 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-12-02 13:44:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:44:26,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:44:26,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 13:44:26,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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 13:44:26,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9209))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9208) .cse0 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9208) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 13:44:26,834 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9208) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9209))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9208) .cse3 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:44:28,362 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9303))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9302) .cse1 v_ArrVal_9208) (select (select (store .cse2 .cse1 v_ArrVal_9209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9211))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9303))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9209))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9302) .cse4 v_ArrVal_9208) .cse5 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:44:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283719964] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:44:28,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:44:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 13:44:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465498292] [2023-12-02 13:44:28,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:44:28,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 13:44:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:44:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 13:44:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 13:44:28,379 INFO L87 Difference]: Start difference. First operand 2919 states and 5024 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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-12-02 13:44:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:57,204 INFO L93 Difference]: Finished difference Result 5126 states and 9291 transitions. [2023-12-02 13:44:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:44:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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 112 [2023-12-02 13:44:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:57,214 INFO L225 Difference]: With dead ends: 5126 [2023-12-02 13:44:57,214 INFO L226 Difference]: Without dead ends: 5126 [2023-12-02 13:44:57,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 13:44:57,215 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 1503 mSDsluCounter, 16193 mSDsCounter, 0 mSdLazyCounter, 8424 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 18651 SdHoareTripleChecker+Invalid, 8432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 8424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:57,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 18651 Invalid, 8432 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 8424 Invalid, 0 Unknown, 0 Unchecked, 28.0s Time] [2023-12-02 13:44:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2023-12-02 13:44:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2918. [2023-12-02 13:44:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 1575 states have (on average 1.9136507936507936) internal successors, (3014), 2910 states have internal predecessors, (3014), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 13:44:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 5023 transitions. [2023-12-02 13:44:57,912 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 5023 transitions. Word has length 112 [2023-12-02 13:44:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:57,912 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 5023 transitions. [2023-12-02 13:44:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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-12-02 13:44:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 5023 transitions. [2023-12-02 13:44:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 13:44:57,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:57,914 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] [2023-12-02 13:44:57,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 13:44:58,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 13:44:58,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:44:58,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:44:58,514 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 13:44:58,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1702596636, now seen corresponding path program 1 times [2023-12-02 13:44:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:44:58,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156127981] [2023-12-02 13:44:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:58,517 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-12-02 13:44:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:44:58,518 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:44:58,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Waiting until timeout for monitored process [2023-12-02 13:44:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:59,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 13:44:59,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:59,661 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-12-02 13:44:59,916 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-12-02 13:44:59,941 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:44:59,941 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-12-02 13:44:59,985 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-12-02 13:45:00,015 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-12-02 13:45:00,157 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-12-02 13:45:00,164 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-12-02 13:45:01,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:45:01,309 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-12-02 13:45:01,322 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-12-02 13:45:01,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:45:01,505 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-12-02 13:45:01,525 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-12-02 13:45:01,669 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:45:01,669 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-12-02 13:45:01,684 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-12-02 13:45:01,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:45:01,841 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-12-02 13:45:01,862 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-12-02 13:45:01,881 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-12-02 13:45:01,893 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-12-02 13:45:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 13:45:01,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:45:02,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:45:02,220 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 13:45:02,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9804))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9805) .cse0 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9805) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 13:45:02,316 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9805) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9804))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9805) .cse3 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:45:02,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9803))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9804))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9802) .cse0 v_ArrVal_9805) .cse1 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9803))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9802) .cse6 v_ArrVal_9805) (select (select (store .cse7 .cse6 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9807))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-12-02 13:45:02,446 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9802) .cse2 v_ArrVal_9805) (select (select (store .cse3 .cse2 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9807))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9803))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9804))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9802) .cse5 v_ArrVal_9805) .cse6 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 13:45:03,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9899 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9898 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9899))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9898) .cse1 v_ArrVal_9802) .cse2 v_ArrVal_9805) (select (select (store .cse3 .cse2 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9807))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9899 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9898 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9899))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9803))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9804))) (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$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9898) .cse6 v_ArrVal_9802) .cse7 v_ArrVal_9805) .cse8 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 13:45:03,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:45:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156127981] [2023-12-02 13:45:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156127981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [758403757] [2023-12-02 13:45:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:03,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:45:03,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:45:03,954 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:45:03,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a461ff48-a03b-4f0b-a327-4e86688201ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process