./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:21:08,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:21:08,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 16:21:08,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:21:08,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:21:08,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:21:08,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:21:08,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:21:08,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:21:08,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:21:08,955 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:21:08,956 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:21:08,956 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:21:08,957 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:21:08,957 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:21:08,958 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:21:08,958 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:21:08,959 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:21:08,960 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:21:08,960 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:21:08,961 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:21:08,961 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:21:08,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:21:08,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:21:08,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:21:08,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:21:08,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:21:08,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:21:08,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:21:08,965 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:21:08,966 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:21:08,966 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:21:08,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:21:08,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:21:08,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:21:08,967 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:21:08,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:21:08,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:21:08,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:21:08,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:21:08,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:21:08,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:21:08,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:21:08,969 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:21:08,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:21:08,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:21:08,970 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:21:08,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:21:08,970 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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 -> 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 [2023-12-02 16:21:09,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:21:09,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:21:09,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:21:09,238 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:21:09,238 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:21:09,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2023-12-02 16:21:11,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:21:12,240 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:21:12,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2023-12-02 16:21:12,258 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data/420dc9132/3db996e851ae47278649a70495d29179/FLAG57848126b [2023-12-02 16:21:12,270 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data/420dc9132/3db996e851ae47278649a70495d29179 [2023-12-02 16:21:12,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:21:12,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:21:12,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:21:12,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:21:12,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:21:12,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:21:12" (1/1) ... [2023-12-02 16:21:12,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e439e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:12, skipping insertion in model container [2023-12-02 16:21:12,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:21:12" (1/1) ... [2023-12-02 16:21:12,340 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:21:12,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:21:12,799 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 16:21:12,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e5c0ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:12, skipping insertion in model container [2023-12-02 16:21:12,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:21:12,800 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 16:21:12,802 INFO L158 Benchmark]: Toolchain (without parser) took 527.08ms. Allocated memory is still 146.8MB. Free memory was 106.8MB in the beginning and 85.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 16:21:12,802 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:21:12,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.67ms. Allocated memory is still 146.8MB. Free memory was 106.8MB in the beginning and 85.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 16:21:12,804 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.15ms. Allocated memory is still 109.1MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.67ms. Allocated memory is still 146.8MB. Free memory was 106.8MB in the beginning and 85.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:21:14,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:21:14,566 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 16:21:14,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:21:14,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:21:14,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:21:14,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:21:14,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:21:14,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:21:14,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:21:14,604 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:21:14,605 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:21:14,605 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:21:14,606 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:21:14,606 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:21:14,607 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:21:14,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:21:14,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:21:14,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:21:14,610 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:21:14,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:21:14,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:21:14,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:21:14,612 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:21:14,612 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:21:14,613 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:21:14,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:21:14,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:21:14,614 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 16:21:14,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 16:21:14,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:21:14,615 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:21:14,615 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:21:14,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:21:14,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 16:21:14,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:21:14,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:21:14,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:21:14,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:21:14,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:21:14,618 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 16:21:14,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 16:21:14,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:21:14,618 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:21:14,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:21:14,619 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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 -> 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 [2023-12-02 16:21:14,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:21:14,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:21:14,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:21:14,928 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:21:14,928 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:21:14,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2023-12-02 16:21:17,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:21:18,000 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:21:18,000 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2023-12-02 16:21:18,019 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data/c6457708d/e532414e928b4adda1574547819140e1/FLAG4099d22f1 [2023-12-02 16:21:18,034 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/data/c6457708d/e532414e928b4adda1574547819140e1 [2023-12-02 16:21:18,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:21:18,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:21:18,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:21:18,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:21:18,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:21:18,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:18,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aac5418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18, skipping insertion in model container [2023-12-02 16:21:18,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:18,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:21:18,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:21:18,660 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 16:21:18,682 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:21:18,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:21:18,807 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:21:18,892 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:21:18,930 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:21:18,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18 WrapperNode [2023-12-02 16:21:18,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:21:18,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:21:18,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:21:18,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:21:18,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:18,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,046 INFO L138 Inliner]: procedures = 180, calls = 401, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1340 [2023-12-02 16:21:19,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:21:19,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:21:19,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:21:19,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:21:19,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:21:19,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:21:19,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:21:19,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:21:19,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (1/1) ... [2023-12-02 16:21:19,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:21:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:21:19,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:21:19,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:21:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 16:21:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 16:21:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 16:21:19,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 16:21:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 16:21:19,246 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 16:21:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:21:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:21:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 16:21:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:21:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:21:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:21:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 16:21:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 16:21:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:21:19,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:21:19,475 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:21:19,477 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:21:19,482 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 16:21:24,925 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:21:25,113 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:21:25,113 INFO L309 CfgBuilder]: Removed 69 assume(true) statements. [2023-12-02 16:21:25,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:21:25 BoogieIcfgContainer [2023-12-02 16:21:25,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:21:25,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:21:25,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:21:25,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:21:25,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:21:18" (1/3) ... [2023-12-02 16:21:25,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e28604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:21:25, skipping insertion in model container [2023-12-02 16:21:25,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:18" (2/3) ... [2023-12-02 16:21:25,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e28604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:21:25, skipping insertion in model container [2023-12-02 16:21:25,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:21:25" (3/3) ... [2023-12-02 16:21:25,123 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-2.i [2023-12-02 16:21:25,142 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:21:25,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 753 error locations. [2023-12-02 16:21:25,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:21:25,213 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;@699e1854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:21:25,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 753 error locations. [2023-12-02 16:21:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 16:21:25,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:25,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 16:21:25,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:25,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 70444892, now seen corresponding path program 1 times [2023-12-02 16:21:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:25,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874978209] [2023-12-02 16:21:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:25,246 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 16:21:25,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:25,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:25,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:25,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 16:21:25,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:25,456 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 16:21:25,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:25,457 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874978209] [2023-12-02 16:21:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874978209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:21:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805006947] [2023-12-02 16:21:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:25,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 16:21:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 16:21:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 16:21:25,497 INFO L87 Difference]: Start difference. First operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 16:21:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:26,365 INFO L93 Difference]: Finished difference Result 1321 states and 1404 transitions. [2023-12-02 16:21:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 16:21:26,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 16:21:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:26,385 INFO L225 Difference]: With dead ends: 1321 [2023-12-02 16:21:26,386 INFO L226 Difference]: Without dead ends: 1320 [2023-12-02 16:21:26,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 16:21:26,389 INFO L413 NwaCegarLoop]: 1261 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:26,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1261 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 16:21:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-12-02 16:21:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2023-12-02 16:21:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 565 states have (on average 2.426548672566372) internal successors, (1371), 1311 states have internal predecessors, (1371), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1403 transitions. [2023-12-02 16:21:26,478 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1403 transitions. Word has length 4 [2023-12-02 16:21:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:26,479 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1403 transitions. [2023-12-02 16:21:26,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 16:21:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1403 transitions. [2023-12-02 16:21:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 16:21:26,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:26,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 16:21:26,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:21:26,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:26,682 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:26,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash 70444954, now seen corresponding path program 1 times [2023-12-02 16:21:26,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:26,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056228281] [2023-12-02 16:21:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:26,683 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 16:21:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:26,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:26,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:26,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:21:26,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:26,855 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 16:21:26,868 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 16:21:26,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:26,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056228281] [2023-12-02 16:21:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056228281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:21:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815107542] [2023-12-02 16:21:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:26,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:21:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:21:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:21:26,872 INFO L87 Difference]: Start difference. First operand 1320 states and 1403 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 16:21:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:29,353 INFO L93 Difference]: Finished difference Result 1350 states and 1446 transitions. [2023-12-02 16:21:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:21:29,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 16:21:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:29,360 INFO L225 Difference]: With dead ends: 1350 [2023-12-02 16:21:29,360 INFO L226 Difference]: Without dead ends: 1350 [2023-12-02 16:21:29,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:21:29,362 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 1042 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:29,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 838 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 16:21:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-12-02 16:21:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1293. [2023-12-02 16:21:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 631 states have (on average 2.223454833597464) internal successors, (1403), 1284 states have internal predecessors, (1403), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1435 transitions. [2023-12-02 16:21:29,404 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1435 transitions. Word has length 4 [2023-12-02 16:21:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:29,404 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1435 transitions. [2023-12-02 16:21:29,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 16:21:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1435 transitions. [2023-12-02 16:21:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 16:21:29,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:29,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 16:21:29,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:29,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:29,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash 70444955, now seen corresponding path program 1 times [2023-12-02 16:21:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:29,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191384509] [2023-12-02 16:21:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:29,608 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 16:21:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:29,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:29,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:29,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:21:29,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:29,716 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 16:21:29,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 16:21:29,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:29,737 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191384509] [2023-12-02 16:21:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191384509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:29,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:21:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494390964] [2023-12-02 16:21:29,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:29,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:21:29,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:29,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:21:29,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:21:29,740 INFO L87 Difference]: Start difference. First operand 1293 states and 1435 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 16:21:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:33,649 INFO L93 Difference]: Finished difference Result 1565 states and 1727 transitions. [2023-12-02 16:21:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:21:33,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-02 16:21:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:33,658 INFO L225 Difference]: With dead ends: 1565 [2023-12-02 16:21:33,658 INFO L226 Difference]: Without dead ends: 1565 [2023-12-02 16:21:33,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:21:33,660 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 456 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:33,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1462 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 16:21:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-12-02 16:21:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1416. [2023-12-02 16:21:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 764 states have (on average 2.193717277486911) internal successors, (1676), 1407 states have internal predecessors, (1676), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1708 transitions. [2023-12-02 16:21:33,690 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1708 transitions. Word has length 4 [2023-12-02 16:21:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:33,691 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1708 transitions. [2023-12-02 16:21:33,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 16:21:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1708 transitions. [2023-12-02 16:21:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 16:21:33,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:33,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 16:21:33,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:21:33,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:33,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:33,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2109482456, now seen corresponding path program 1 times [2023-12-02 16:21:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:33,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484437405] [2023-12-02 16:21:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:33,893 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 16:21:33,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:33,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:33,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:33,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 16:21:33,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:33,975 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 16:21:33,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:33,976 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484437405] [2023-12-02 16:21:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484437405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:21:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150458460] [2023-12-02 16:21:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:33,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:21:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:21:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:21:33,978 INFO L87 Difference]: Start difference. First operand 1416 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:35,531 INFO L93 Difference]: Finished difference Result 2605 states and 3158 transitions. [2023-12-02 16:21:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:21:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 16:21:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:35,543 INFO L225 Difference]: With dead ends: 2605 [2023-12-02 16:21:35,544 INFO L226 Difference]: Without dead ends: 2605 [2023-12-02 16:21:35,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:21:35,545 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 1029 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:35,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2710 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 16:21:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2023-12-02 16:21:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1417. [2023-12-02 16:21:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 765 states have (on average 2.1921568627450982) internal successors, (1677), 1408 states have internal predecessors, (1677), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1709 transitions. [2023-12-02 16:21:35,579 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1709 transitions. Word has length 5 [2023-12-02 16:21:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:35,580 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1709 transitions. [2023-12-02 16:21:35,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1709 transitions. [2023-12-02 16:21:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 16:21:35,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:35,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:21:35,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Ended with exit code 0 [2023-12-02 16:21:35,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:35,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:35,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 658452484, now seen corresponding path program 1 times [2023-12-02 16:21:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373898587] [2023-12-02 16:21:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:35,783 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 16:21:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:35,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:35,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:35,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 16:21:35,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:21:35,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:35,938 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373898587] [2023-12-02 16:21:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373898587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:35,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:35,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:21:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472905387] [2023-12-02 16:21:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:35,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:21:35,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:21:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:21:35,941 INFO L87 Difference]: Start difference. First operand 1417 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 16:21:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:36,998 INFO L93 Difference]: Finished difference Result 1378 states and 1669 transitions. [2023-12-02 16:21:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:21:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 16:21:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:37,006 INFO L225 Difference]: With dead ends: 1378 [2023-12-02 16:21:37,007 INFO L226 Difference]: Without dead ends: 1378 [2023-12-02 16:21:37,007 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 16:21:37,007 INFO L413 NwaCegarLoop]: 1109 mSDtfsCounter, 70 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:37,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2169 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 16:21:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-12-02 16:21:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-12-02 16:21:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 750 states have (on average 2.1826666666666665) internal successors, (1637), 1369 states have internal predecessors, (1637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1669 transitions. [2023-12-02 16:21:37,039 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1669 transitions. Word has length 10 [2023-12-02 16:21:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:37,039 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1669 transitions. [2023-12-02 16:21:37,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 16:21:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1669 transitions. [2023-12-02 16:21:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 16:21:37,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:37,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:21:37,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:37,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:37,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:37,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1412640446, now seen corresponding path program 1 times [2023-12-02 16:21:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:37,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438449911] [2023-12-02 16:21:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:37,244 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 16:21:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:37,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:37,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:37,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:21:37,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:37,381 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 16:21:37,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:37,381 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:37,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438449911] [2023-12-02 16:21:37,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438449911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:37,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:37,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:21:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531455279] [2023-12-02 16:21:37,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:37,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:21:37,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:37,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:21:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:21:37,383 INFO L87 Difference]: Start difference. First operand 1378 states and 1669 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 16:21:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:38,909 INFO L93 Difference]: Finished difference Result 1364 states and 1648 transitions. [2023-12-02 16:21:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:21:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 16:21:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:38,916 INFO L225 Difference]: With dead ends: 1364 [2023-12-02 16:21:38,917 INFO L226 Difference]: Without dead ends: 1364 [2023-12-02 16:21:38,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 16:21:38,917 INFO L413 NwaCegarLoop]: 1078 mSDtfsCounter, 58 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:38,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3210 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 16:21:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-12-02 16:21:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1363. [2023-12-02 16:21:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 749 states have (on average 2.156208277703605) internal successors, (1615), 1354 states have internal predecessors, (1615), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1647 transitions. [2023-12-02 16:21:38,947 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1647 transitions. Word has length 12 [2023-12-02 16:21:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:38,948 INFO L495 AbstractCegarLoop]: Abstraction has 1363 states and 1647 transitions. [2023-12-02 16:21:38,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 16:21:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1647 transitions. [2023-12-02 16:21:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 16:21:38,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:38,949 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] [2023-12-02 16:21:38,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:21:39,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:39,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:39,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 143090636, now seen corresponding path program 1 times [2023-12-02 16:21:39,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:39,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288238444] [2023-12-02 16:21:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:39,158 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 16:21:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:39,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:39,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:39,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:21:39,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:39,286 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 16:21:39,350 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 16:21:39,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:39,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288238444] [2023-12-02 16:21:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288238444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:21:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783005878] [2023-12-02 16:21:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:21:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:21:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:21:39,352 INFO L87 Difference]: Start difference. First operand 1363 states and 1647 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 16:21:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:42,394 INFO L93 Difference]: Finished difference Result 1416 states and 1654 transitions. [2023-12-02 16:21:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:21:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-12-02 16:21:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:42,402 INFO L225 Difference]: With dead ends: 1416 [2023-12-02 16:21:42,402 INFO L226 Difference]: Without dead ends: 1416 [2023-12-02 16:21:42,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 16:21:42,402 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 977 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:42,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1267 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 16:21:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2023-12-02 16:21:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1359. [2023-12-02 16:21:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 749 states have (on average 2.15086782376502) internal successors, (1611), 1350 states have internal predecessors, (1611), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1643 transitions. [2023-12-02 16:21:42,430 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1643 transitions. Word has length 26 [2023-12-02 16:21:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:42,431 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 1643 transitions. [2023-12-02 16:21:42,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 16:21:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1643 transitions. [2023-12-02 16:21:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 16:21:42,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:42,432 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] [2023-12-02 16:21:42,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:42,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:42,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:42,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 143090637, now seen corresponding path program 1 times [2023-12-02 16:21:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:42,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717653726] [2023-12-02 16:21:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:42,634 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 16:21:42,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:42,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:42,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:42,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:21:42,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:42,765 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 16:21:42,943 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 16:21:42,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:42,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717653726] [2023-12-02 16:21:42,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717653726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:42,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:21:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136474638] [2023-12-02 16:21:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:42,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:21:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:42,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:21:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:21:42,945 INFO L87 Difference]: Start difference. First operand 1359 states and 1643 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 16:21:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:47,299 INFO L93 Difference]: Finished difference Result 1504 states and 1658 transitions. [2023-12-02 16:21:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:21:47,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-12-02 16:21:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:47,306 INFO L225 Difference]: With dead ends: 1504 [2023-12-02 16:21:47,306 INFO L226 Difference]: Without dead ends: 1504 [2023-12-02 16:21:47,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 16:21:47,307 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 393 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:47,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1938 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 16:21:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2023-12-02 16:21:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1355. [2023-12-02 16:21:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 749 states have (on average 2.145527369826435) internal successors, (1607), 1346 states have internal predecessors, (1607), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1639 transitions. [2023-12-02 16:21:47,338 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1639 transitions. Word has length 26 [2023-12-02 16:21:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:47,339 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1639 transitions. [2023-12-02 16:21:47,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 16:21:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1639 transitions. [2023-12-02 16:21:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 16:21:47,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:47,341 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] [2023-12-02 16:21:47,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:47,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:47,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:47,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash 528621638, now seen corresponding path program 1 times [2023-12-02 16:21:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:47,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404048791] [2023-12-02 16:21:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:47,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:21:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:47,544 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:47,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:47,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:21:47,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:47,829 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 16:21:47,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:47,829 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404048791] [2023-12-02 16:21:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404048791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:21:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217391721] [2023-12-02 16:21:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:47,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:21:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:21:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:21:47,831 INFO L87 Difference]: Start difference. First operand 1355 states and 1639 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:49,025 INFO L93 Difference]: Finished difference Result 1349 states and 1629 transitions. [2023-12-02 16:21:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:21:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-02 16:21:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:49,032 INFO L225 Difference]: With dead ends: 1349 [2023-12-02 16:21:49,032 INFO L226 Difference]: Without dead ends: 1349 [2023-12-02 16:21:49,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:21:49,032 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 23 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:49,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3196 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 16:21:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-02 16:21:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2023-12-02 16:21:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 743 states have (on average 2.149394347240915) internal successors, (1597), 1340 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1629 transitions. [2023-12-02 16:21:49,051 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1629 transitions. Word has length 42 [2023-12-02 16:21:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:49,051 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1629 transitions. [2023-12-02 16:21:49,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1629 transitions. [2023-12-02 16:21:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 16:21:49,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:49,053 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] [2023-12-02 16:21:49,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:49,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:49,254 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:49,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -341001050, now seen corresponding path program 1 times [2023-12-02 16:21:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:49,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076520957] [2023-12-02 16:21:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:49,255 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 16:21:49,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:49,256 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:49,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:49,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:21:49,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:49,722 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 16:21:49,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:49,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076520957] [2023-12-02 16:21:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076520957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:49,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:49,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:21:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735106034] [2023-12-02 16:21:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:49,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:21:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:21:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:21:49,725 INFO L87 Difference]: Start difference. First operand 1349 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 16:21:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:50,907 INFO L93 Difference]: Finished difference Result 1572 states and 1861 transitions. [2023-12-02 16:21:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:21:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-12-02 16:21:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:50,917 INFO L225 Difference]: With dead ends: 1572 [2023-12-02 16:21:50,917 INFO L226 Difference]: Without dead ends: 1572 [2023-12-02 16:21:50,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 16:21:50,917 INFO L413 NwaCegarLoop]: 1139 mSDtfsCounter, 246 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:50,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2112 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 16:21:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-12-02 16:21:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1392. [2023-12-02 16:21:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 786 states have (on average 2.0865139949109417) internal successors, (1640), 1383 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1672 transitions. [2023-12-02 16:21:50,937 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1672 transitions. Word has length 46 [2023-12-02 16:21:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:50,937 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1672 transitions. [2023-12-02 16:21:50,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 16:21:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1672 transitions. [2023-12-02 16:21:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:21:50,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:50,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:21:50,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Ended with exit code 0 [2023-12-02 16:21:51,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:51,142 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:51,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1272107280, now seen corresponding path program 1 times [2023-12-02 16:21:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995279564] [2023-12-02 16:21:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:51,144 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 16:21:51,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:51,145 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:51,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:51,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:21:51,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:51,427 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 16:21:51,435 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 16:21:51,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:21:51,908 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 16:21:51,924 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:21:51,925 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 16:21:51,946 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 16:21:51,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:51,946 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995279564] [2023-12-02 16:21:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995279564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:51,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:51,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:21:51,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23045934] [2023-12-02 16:21:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:51,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:21:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:51,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:21:51,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:21:51,949 INFO L87 Difference]: Start difference. First operand 1392 states and 1672 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:55,217 INFO L93 Difference]: Finished difference Result 1364 states and 1598 transitions. [2023-12-02 16:21:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:21:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-02 16:21:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:55,224 INFO L225 Difference]: With dead ends: 1364 [2023-12-02 16:21:55,224 INFO L226 Difference]: Without dead ends: 1364 [2023-12-02 16:21:55,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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 16:21:55,225 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 943 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:55,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 702 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-02 16:21:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-12-02 16:21:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1175. [2023-12-02 16:21:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1304 transitions. [2023-12-02 16:21:55,246 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1304 transitions. Word has length 49 [2023-12-02 16:21:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1304 transitions. [2023-12-02 16:21:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1304 transitions. [2023-12-02 16:21:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 16:21:55,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:55,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:21:55,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:55,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:55,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:55,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash -570099047, now seen corresponding path program 1 times [2023-12-02 16:21:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:55,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64178945] [2023-12-02 16:21:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:21:55,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:55,457 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:55,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:55,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:21:55,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:55,670 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 16:21:55,684 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 16:21:55,713 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 16:21:55,721 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 16:21:55,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:55,721 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64178945] [2023-12-02 16:21:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64178945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:55,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:55,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:21:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863325383] [2023-12-02 16:21:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:55,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:21:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:21:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:21:55,723 INFO L87 Difference]: Start difference. First operand 1175 states and 1304 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:21:59,192 INFO L93 Difference]: Finished difference Result 1174 states and 1303 transitions. [2023-12-02 16:21:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:21:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 16:21:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:21:59,196 INFO L225 Difference]: With dead ends: 1174 [2023-12-02 16:21:59,196 INFO L226 Difference]: Without dead ends: 1174 [2023-12-02 16:21:59,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 16:21:59,197 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 3 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:21:59,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2556 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 16:21:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-12-02 16:21:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2023-12-02 16:21:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 653 states have (on average 1.9464012251148546) internal successors, (1271), 1165 states have internal predecessors, (1271), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:21:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1303 transitions. [2023-12-02 16:21:59,213 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1303 transitions. Word has length 53 [2023-12-02 16:21:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:21:59,213 INFO L495 AbstractCegarLoop]: Abstraction has 1174 states and 1303 transitions. [2023-12-02 16:21:59,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:21:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1303 transitions. [2023-12-02 16:21:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 16:21:59,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:21:59,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:21:59,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Ended with exit code 0 [2023-12-02 16:21:59,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:59,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:21:59,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:21:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash -570099046, now seen corresponding path program 1 times [2023-12-02 16:21:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:21:59,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936592386] [2023-12-02 16:21:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:21:59,416 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 16:21:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:21:59,417 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:59,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:21:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:21:59,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 16:21:59,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:21:59,639 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 16:21:59,659 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 16:21:59,672 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 16:21:59,715 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 16:21:59,735 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 16:21:59,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:21:59,735 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:21:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936592386] [2023-12-02 16:21:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936592386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:21:59,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:21:59,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:21:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034554901] [2023-12-02 16:21:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:21:59,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:21:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:21:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:21:59,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:21:59,738 INFO L87 Difference]: Start difference. First operand 1174 states and 1303 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:22:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:22:04,337 INFO L93 Difference]: Finished difference Result 1173 states and 1302 transitions. [2023-12-02 16:22:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:22:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 16:22:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:22:04,342 INFO L225 Difference]: With dead ends: 1173 [2023-12-02 16:22:04,342 INFO L226 Difference]: Without dead ends: 1173 [2023-12-02 16:22:04,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 16:22:04,343 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 1 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:22:04,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2593 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 16:22:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-12-02 16:22:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2023-12-02 16:22:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 652 states have (on average 1.9478527607361964) internal successors, (1270), 1164 states have internal predecessors, (1270), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 16:22:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1302 transitions. [2023-12-02 16:22:04,361 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1302 transitions. Word has length 53 [2023-12-02 16:22:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:22:04,361 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1302 transitions. [2023-12-02 16:22:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:22:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1302 transitions. [2023-12-02 16:22:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 16:22:04,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:22:04,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:22:04,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:04,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:04,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:22:04,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:22:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2128582719, now seen corresponding path program 1 times [2023-12-02 16:22:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:22:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722915973] [2023-12-02 16:22:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:04,564 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 16:22:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:22:04,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:04,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:04,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:22:04,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:04,814 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 16:22:04,815 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:22:04,815 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:22:04,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722915973] [2023-12-02 16:22:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722915973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:22:04,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:22:04,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:22:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621018890] [2023-12-02 16:22:04,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:22:04,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:22:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:22:04,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:22:04,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:22:04,817 INFO L87 Difference]: Start difference. First operand 1173 states and 1302 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 16:22:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:22:06,062 INFO L93 Difference]: Finished difference Result 1175 states and 1306 transitions. [2023-12-02 16:22:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:22:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2023-12-02 16:22:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:22:06,068 INFO L225 Difference]: With dead ends: 1175 [2023-12-02 16:22:06,068 INFO L226 Difference]: Without dead ends: 1175 [2023-12-02 16:22:06,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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 16:22:06,069 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:22:06,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2991 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 16:22:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-12-02 16:22:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2023-12-02 16:22:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:22:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1306 transitions. [2023-12-02 16:22:06,085 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1306 transitions. Word has length 59 [2023-12-02 16:22:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:22:06,085 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1306 transitions. [2023-12-02 16:22:06,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 16:22:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1306 transitions. [2023-12-02 16:22:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 16:22:06,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:22:06,087 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] [2023-12-02 16:22:06,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:22:06,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:06,288 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:22:06,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:22:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1894039622, now seen corresponding path program 1 times [2023-12-02 16:22:06,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:22:06,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146987397] [2023-12-02 16:22:06,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:06,290 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 16:22:06,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:22:06,291 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:06,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:06,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:22:06,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:06,554 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 16:22:06,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:06,614 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 16:22:06,615 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:22:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146987397] [2023-12-02 16:22:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146987397] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981360708] [2023-12-02 16:22:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:22:06,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:22:06,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:22:06,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 16:22:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:07,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:22:07,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:07,027 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 16:22:07,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:07,053 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 16:22:07,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1981360708] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:07,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195600437] [2023-12-02 16:22:07,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:07,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:22:07,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:22:07,054 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:22:07,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 16:22:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:07,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:22:07,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:07,300 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 16:22:07,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:07,324 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 16:22:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195600437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:07,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 16:22:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 16:22:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010565581] [2023-12-02 16:22:07,324 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 16:22:07,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:22:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:22:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:22:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:22:07,326 INFO L87 Difference]: Start difference. First operand 1175 states and 1306 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 16:22:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:22:08,714 INFO L93 Difference]: Finished difference Result 1184 states and 1321 transitions. [2023-12-02 16:22:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:22:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2023-12-02 16:22:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:22:08,720 INFO L225 Difference]: With dead ends: 1184 [2023-12-02 16:22:08,720 INFO L226 Difference]: Without dead ends: 1184 [2023-12-02 16:22:08,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 16:22:08,720 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 7 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:22:08,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2987 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 16:22:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2023-12-02 16:22:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1183. [2023-12-02 16:22:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 660 states have (on average 1.946969696969697) internal successors, (1285), 1173 states have internal predecessors, (1285), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:22:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1319 transitions. [2023-12-02 16:22:08,741 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1319 transitions. Word has length 60 [2023-12-02 16:22:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:22:08,741 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1319 transitions. [2023-12-02 16:22:08,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 16:22:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1319 transitions. [2023-12-02 16:22:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 16:22:08,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:22:08,742 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] [2023-12-02 16:22:08,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:08,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-02 16:22:09,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-02 16:22:09,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:22:09,343 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:22:09,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:22:09,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2075451649, now seen corresponding path program 2 times [2023-12-02 16:22:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:22:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044818946] [2023-12-02 16:22:09,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:22:09,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:22:09,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:22:09,345 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:09,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:09,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:22:09,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:22:09,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:22:09,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:09,813 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 16:22:09,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:09,945 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 16:22:09,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:22:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044818946] [2023-12-02 16:22:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044818946] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2145602068] [2023-12-02 16:22:09,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:22:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:22:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:22:09,946 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:22:09,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 16:22:10,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:22:10,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:22:10,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:22:10,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:10,963 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 16:22:10,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:11,013 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 16:22:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2145602068] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:11,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944705205] [2023-12-02 16:22:11,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:22:11,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:22:11,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:22:11,014 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:22:11,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 16:22:23,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:22:23,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:22:23,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 16:22:23,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:23,768 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:22:23,768 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 16:22:23,795 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 16:22:24,059 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:22:24,059 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 16:22:24,131 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 16:22:24,166 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 16:22:24,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:24,285 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 16:22:24,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 25 treesize of output 24 [2023-12-02 16:22:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944705205] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:22:24,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 16:22:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 16:22:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766181603] [2023-12-02 16:22:24,388 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 16:22:24,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 16:22:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:22:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 16:22:24,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=550, Unknown=9, NotChecked=0, Total=650 [2023-12-02 16:22:24,390 INFO L87 Difference]: Start difference. First operand 1183 states and 1319 transitions. Second operand has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 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 16:22:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:22:40,481 INFO L93 Difference]: Finished difference Result 1253 states and 1355 transitions. [2023-12-02 16:22:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 16:22:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 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 63 [2023-12-02 16:22:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:22:40,486 INFO L225 Difference]: With dead ends: 1253 [2023-12-02 16:22:40,486 INFO L226 Difference]: Without dead ends: 1251 [2023-12-02 16:22:40,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=2500, Unknown=12, NotChecked=0, Total=2970 [2023-12-02 16:22:40,488 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 881 mSDsluCounter, 8348 mSDsCounter, 0 mSdLazyCounter, 9899 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 9946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 9899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:22:40,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 8948 Invalid, 9946 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 9899 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2023-12-02 16:22:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-12-02 16:22:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1191. [2023-12-02 16:22:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 669 states have (on average 1.937219730941704) internal successors, (1296), 1181 states have internal predecessors, (1296), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:22:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1330 transitions. [2023-12-02 16:22:40,502 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1330 transitions. Word has length 63 [2023-12-02 16:22:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:22:40,502 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1330 transitions. [2023-12-02 16:22:40,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 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 16:22:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1330 transitions. [2023-12-02 16:22:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 16:22:40,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:22:40,504 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] [2023-12-02 16:22:40,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 16:22:40,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 16:22:40,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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)] Ended with exit code 0 [2023-12-02 16:22:41,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:41,105 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:22:41,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:22:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash 399824160, now seen corresponding path program 1 times [2023-12-02 16:22:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:22:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056956150] [2023-12-02 16:22:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:41,106 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 16:22:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:22:41,106 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:41,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:41,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:22:41,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:41,514 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 16:22:41,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:41,986 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 16:22:41,987 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:22:41,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056956150] [2023-12-02 16:22:41,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056956150] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:41,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991085363] [2023-12-02 16:22:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:41,987 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:22:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:22:41,988 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:22:41,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 16:22:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:42,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:22:42,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:42,511 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 16:22:42,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:42,626 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 16:22:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [991085363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095129442] [2023-12-02 16:22:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:22:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:22:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:22:42,628 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:22:42,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 16:22:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:22:42,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 16:22:42,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:42,997 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 16:22:42,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:43,718 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 16:22:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095129442] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:43,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 16:22:43,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 16:22:43,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341856173] [2023-12-02 16:22:43,719 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 16:22:43,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 16:22:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:22:43,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 16:22:43,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 16:22:43,721 INFO L87 Difference]: Start difference. First operand 1191 states and 1330 transitions. Second operand has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 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 16:22:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:22:51,737 INFO L93 Difference]: Finished difference Result 1221 states and 1384 transitions. [2023-12-02 16:22:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 16:22:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 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 69 [2023-12-02 16:22:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:22:51,744 INFO L225 Difference]: With dead ends: 1221 [2023-12-02 16:22:51,744 INFO L226 Difference]: Without dead ends: 1218 [2023-12-02 16:22:51,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 16:22:51,746 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 27 mSDsluCounter, 13876 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 14870 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:22:51,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 14870 Invalid, 2953 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [90 Valid, 2863 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-02 16:22:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2023-12-02 16:22:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1209. [2023-12-02 16:22:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 687 states have (on average 1.9199417758369723) internal successors, (1319), 1199 states have internal predecessors, (1319), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:22:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1353 transitions. [2023-12-02 16:22:51,761 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1353 transitions. Word has length 69 [2023-12-02 16:22:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:22:51,761 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1353 transitions. [2023-12-02 16:22:51,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 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 16:22:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1353 transitions. [2023-12-02 16:22:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 16:22:51,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:22:51,762 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] [2023-12-02 16:22:51,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:51,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 16:22:52,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 16:22:52,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:22:52,363 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:22:52,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:22:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -259065504, now seen corresponding path program 2 times [2023-12-02 16:22:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:22:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342398055] [2023-12-02 16:22:52,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:22:52,365 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 16:22:52,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:22:52,365 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:52,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:22:52,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:22:52,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:22:52,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 16:22:52,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:53,327 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 16:22:53,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:55,474 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 16:22:55,474 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:22:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342398055] [2023-12-02 16:22:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342398055] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148707025] [2023-12-02 16:22:55,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:22:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:22:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:22:55,476 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:22:55,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 16:22:56,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:22:56,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:22:56,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 16:22:56,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:22:56,753 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 16:22:56,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:22:57,284 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 16:22:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [148707025] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:22:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436612381] [2023-12-02 16:22:57,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:22:57,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:22:57,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:22:57,285 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:22:57,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 16:23:10,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:23:10,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:23:10,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 16:23:10,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:23:10,864 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 16:23:10,877 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:23:10,877 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 16:23:10,984 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 16:23:10,998 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 16:23:11,298 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 16:23:11,303 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 16:23:11,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:23:11,896 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 16:23:11,907 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 16:23:12,068 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 16:23:12,074 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 16:23:12,153 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 16:23:12,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:23:13,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:23:13,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436612381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:23:13,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 16:23:13,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 16:23:13,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891247699] [2023-12-02 16:23:13,086 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 16:23:13,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 16:23:13,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:23:13,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 16:23:13,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 16:23:13,090 INFO L87 Difference]: Start difference. First operand 1209 states and 1353 transitions. Second operand has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 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 16:24:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:24:08,901 INFO L93 Difference]: Finished difference Result 1378 states and 1574 transitions. [2023-12-02 16:24:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-12-02 16:24:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 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 81 [2023-12-02 16:24:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:24:08,906 INFO L225 Difference]: With dead ends: 1378 [2023-12-02 16:24:08,906 INFO L226 Difference]: Without dead ends: 1369 [2023-12-02 16:24:08,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7045 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=5889, Invalid=20846, Unknown=1, NotChecked=324, Total=27060 [2023-12-02 16:24:08,914 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 919 mSDsluCounter, 16114 mSDsCounter, 0 mSdLazyCounter, 21625 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 16720 SdHoareTripleChecker+Invalid, 21750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 21625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:24:08,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 16720 Invalid, 21750 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [125 Valid, 21625 Invalid, 0 Unknown, 0 Unchecked, 38.4s Time] [2023-12-02 16:24:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2023-12-02 16:24:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1293. [2023-12-02 16:24:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 771 states have (on average 1.8365758754863812) internal successors, (1416), 1282 states have internal predecessors, (1416), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:24:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1450 transitions. [2023-12-02 16:24:08,941 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1450 transitions. Word has length 81 [2023-12-02 16:24:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:24:08,942 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1450 transitions. [2023-12-02 16:24:08,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 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 16:24:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1450 transitions. [2023-12-02 16:24:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 16:24:08,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:24:08,943 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:24:08,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-12-02 16:24:09,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:24:09,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 16:24:09,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:24:09,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:24:09,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:24:09,544 INFO L85 PathProgramCache]: Analyzing trace with hash -256213520, now seen corresponding path program 1 times [2023-12-02 16:24:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:24:09,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005610284] [2023-12-02 16:24:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:24:09,545 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 16:24:09,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:24:09,546 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:24:09,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:24:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:24:10,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 16:24:10,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:24:10,303 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 16:24:10,410 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:24:10,410 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 16:24:10,445 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 16:24:10,537 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 16:24:11,452 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:24:11,453 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 16:24:11,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:24:11,544 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 16:24:11,555 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 16:24:11,590 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 16:24:11,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:24:13,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2867 (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_2867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:24:14,056 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2913))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2867)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:24:14,059 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:24:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005610284] [2023-12-02 16:24:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005610284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:24:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1171050468] [2023-12-02 16:24:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:24:14,059 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:24:14,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:24:14,060 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:24:14,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 16:24:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:24:16,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 16:24:16,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:24:16,164 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:24:16,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 16:24:16,583 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:24:16,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 16:24:16,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 16:24:16,864 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 28 treesize of output 16 [2023-12-02 16:24:18,268 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:24:18,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 16:24:18,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:24:18,455 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 41 [2023-12-02 16:24:18,472 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 35 treesize of output 19 [2023-12-02 16:24:18,531 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 16:24:18,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:24:18,545 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3320) |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 16:24:18,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3320 (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_3320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:24:18,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3366))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3320)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:24:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1171050468] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:24:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343638189] [2023-12-02 16:24:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:24:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:24:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:24:18,958 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:24:18,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 16:24:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:24:19,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 16:24:19,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:24:19,583 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 16:24:19,684 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:24:19,685 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 16:24:19,723 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 16:24:20,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:24:20,375 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 16:24:20,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:24:20,547 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 16:24:20,559 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 16:24:20,562 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 16:24:20,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:24:23,045 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 16:24:23,045 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 16:24:23,055 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2867 (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~mem33#1.base| v_ArrVal_3818))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2867)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 16:24:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343638189] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:24:23,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:24:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2023-12-02 16:24:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326770830] [2023-12-02 16:24:23,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:24:23,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 16:24:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:24:23,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 16:24:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=740, Unknown=9, NotChecked=366, Total=1260 [2023-12-02 16:24:23,060 INFO L87 Difference]: Start difference. First operand 1293 states and 1450 transitions. Second operand has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 27 states have internal predecessors, (136), 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 16:24:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:24:40,959 INFO L93 Difference]: Finished difference Result 2416 states and 2624 transitions. [2023-12-02 16:24:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 16:24:40,960 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 27 states have internal predecessors, (136), 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 105 [2023-12-02 16:24:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:24:40,970 INFO L225 Difference]: With dead ends: 2416 [2023-12-02 16:24:40,970 INFO L226 Difference]: Without dead ends: 2416 [2023-12-02 16:24:40,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=231, Invalid=1344, Unknown=9, NotChecked=486, Total=2070 [2023-12-02 16:24:40,971 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 2467 mSDsluCounter, 5964 mSDsCounter, 0 mSdLazyCounter, 8651 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 8755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 8651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:24:40,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2490 Valid, 6477 Invalid, 8755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 8651 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2023-12-02 16:24:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2023-12-02 16:24:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1292. [2023-12-02 16:24:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 771 states have (on average 1.835278858625162) internal successors, (1415), 1281 states have internal predecessors, (1415), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:24:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1449 transitions. [2023-12-02 16:24:40,994 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1449 transitions. Word has length 105 [2023-12-02 16:24:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:24:40,994 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1449 transitions. [2023-12-02 16:24:40,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 27 states have internal predecessors, (136), 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 16:24:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1449 transitions. [2023-12-02 16:24:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 16:24:40,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:24:40,996 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] [2023-12-02 16:24:41,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 16:24:41,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:24:41,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-02 16:24:41,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:24:41,600 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:24:41,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:24:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash -256213519, now seen corresponding path program 1 times [2023-12-02 16:24:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:24:41,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860784713] [2023-12-02 16:24:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:24:41,601 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 16:24:41,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:24:41,601 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:24:41,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:24:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:24:42,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 16:24:42,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:24:42,416 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 16:24:42,524 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 16:24:42,537 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:24:42,537 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 16:24:42,567 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 16:24:42,575 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 16:24:42,683 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 16:24:42,687 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 16:24:43,380 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:24:43,381 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 16:24:43,387 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 16:24:43,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:24:43,500 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 16:24:43,512 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 16:24:43,524 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 16:24:43,531 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 16:24:43,557 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 16:24:43,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:24:43,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:24:43,730 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_4270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4271) |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 16:24:44,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4362))) (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~mem33#1.base| v_ArrVal_4363) .cse0 v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4363) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4362) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-12-02 16:24:44,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:24:44,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860784713] [2023-12-02 16:24:44,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860784713] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:24:44,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1698757667] [2023-12-02 16:24:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:24:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:24:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:24:44,966 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:24:44,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 16:26:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:26:40,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 16:26:40,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:26:40,771 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 16:26:41,035 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:26:41,035 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 16:26:41,046 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 16:26:41,097 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 16:26:41,111 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 16:26:41,243 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 16:26:41,247 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 16:26:41,822 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:26:41,822 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 16:26:41,831 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 16:26:41,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:26:41,970 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 16:26:41,975 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 16:26:41,990 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 16:26:41,996 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 16:26:41,998 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 16:26:41,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:26:42,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4816) |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 16:26:42,082 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_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4816) |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 16:26:43,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4908) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4907))) (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~mem33#1.base| v_ArrVal_4908) .cse2 v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 16:26:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1698757667] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:26:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873586443] [2023-12-02 16:26:43,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:26:43,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:26:43,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:26:43,354 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:26:43,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 16:26:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:26:43,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 16:26:43,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:26:43,948 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 16:26:44,043 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:26:44,043 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 16:26:44,050 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 16:26:44,060 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 16:26:44,073 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 16:26:44,113 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 16:26:44,117 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 16:26:44,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:26:44,791 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 16:26:44,800 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 16:26:44,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:26:44,875 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 16:26:44,881 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 16:26:44,899 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 16:26:44,907 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 16:26:44,911 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 16:26:44,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:26:44,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (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| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:26:45,008 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 16:26:46,603 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5453) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#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) .cse0) (bvadd (_ bv8 32) .cse0)))) (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 ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5452))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5453) .cse2 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 16:26:46,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873586443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:26:46,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:26:46,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 16:26:46,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294487943] [2023-12-02 16:26:46,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:26:46,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 16:26:46,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:26:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 16:26:46,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 16:26:46,617 INFO L87 Difference]: Start difference. First operand 1292 states and 1449 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 16:27:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:27:01,342 INFO L93 Difference]: Finished difference Result 1645 states and 1771 transitions. [2023-12-02 16:27:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:27:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 105 [2023-12-02 16:27:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:27:01,347 INFO L225 Difference]: With dead ends: 1645 [2023-12-02 16:27:01,347 INFO L226 Difference]: Without dead ends: 1645 [2023-12-02 16:27:01,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 301 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 16:27:01,348 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1822 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 6726 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 6760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:27:01,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 3112 Invalid, 6760 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6726 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2023-12-02 16:27:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2023-12-02 16:27:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1291. [2023-12-02 16:27:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 771 states have (on average 1.8339818417639429) internal successors, (1414), 1280 states have internal predecessors, (1414), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:27:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1448 transitions. [2023-12-02 16:27:01,369 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1448 transitions. Word has length 105 [2023-12-02 16:27:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:27:01,370 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 1448 transitions. [2023-12-02 16:27:01,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 16:27:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1448 transitions. [2023-12-02 16:27:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 16:27:01,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:27:01,372 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] [2023-12-02 16:27:01,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:27:01,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 16:27:01,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 16:27:01,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:27:01,974 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:27:01,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:27:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1406071941, now seen corresponding path program 1 times [2023-12-02 16:27:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:27:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638146846] [2023-12-02 16:27:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:27:01,975 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 16:27:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:27:01,976 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:27:01,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:27:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:27:02,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 16:27:02,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:27:02,940 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 16:27:03,055 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:27:03,055 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 16:27:03,119 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 16:27:03,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 16:27:04,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:04,116 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 16:27:04,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:04,237 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 16:27:04,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:04,317 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 16:27:04,335 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 16:27:04,375 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 16:27:04,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:27:04,438 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5876) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:27:04,448 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:27:04,461 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5875 (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~mem35#1.base| v_ArrVal_5875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:27:04,475 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5875 (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_5875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:27:04,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5922))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5875)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:27:04,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:27:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638146846] [2023-12-02 16:27:04,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638146846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:27:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236640651] [2023-12-02 16:27:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:27:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:27:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:27:04,867 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:27:04,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 16:27:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:27:29,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 16:27:29,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:27:29,998 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:27:29,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 16:27:30,400 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:27:30,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 16:27:30,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 16:27:30,689 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 28 treesize of output 16 [2023-12-02 16:27:32,010 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:27:32,010 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 41 [2023-12-02 16:27:32,216 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:27:32,216 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 41 [2023-12-02 16:27:32,366 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:27:32,366 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 41 [2023-12-02 16:27:32,391 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 35 treesize of output 19 [2023-12-02 16:27:32,463 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 16:27:32,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:27:32,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6345) |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 16:27:32,490 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6345) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:27:32,504 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 16:27:32,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:27:32,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6391))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6344)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:27:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1236640651] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:27:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667778279] [2023-12-02 16:27:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:27:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:27:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:27:32,911 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:27:32,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 16:27:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:27:33,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 16:27:33,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:27:33,554 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 16:27:33,668 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:27:33,668 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 16:27:33,709 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 16:27:34,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:34,109 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 16:27:34,190 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:34,190 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 16:27:34,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:34,270 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 16:27:34,333 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 16:27:34,337 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 16:27:34,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:27:34,359 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 16:27:34,360 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 16:27:34,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2023-12-02 16:27:34,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (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_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 16:27:34,385 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6812)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 16:27:34,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6812))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 16:27:34,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (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~mem33#1.base| v_ArrVal_6859))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6812)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 16:27:34,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667778279] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:27:34,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:27:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-12-02 16:27:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659160488] [2023-12-02 16:27:34,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:27:34,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 16:27:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:27:34,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 16:27:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=795, Unknown=15, NotChecked=1080, Total=2070 [2023-12-02 16:27:34,748 INFO L87 Difference]: Start difference. First operand 1291 states and 1448 transitions. Second operand has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 30 states have internal predecessors, (142), 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 16:27:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:27:55,436 INFO L93 Difference]: Finished difference Result 2412 states and 2620 transitions. [2023-12-02 16:27:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 16:27:55,437 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 30 states have internal predecessors, (142), 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 107 [2023-12-02 16:27:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:27:55,443 INFO L225 Difference]: With dead ends: 2412 [2023-12-02 16:27:55,443 INFO L226 Difference]: Without dead ends: 2412 [2023-12-02 16:27:55,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=1078, Unknown=15, NotChecked=1230, Total=2550 [2023-12-02 16:27:55,445 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 2468 mSDsluCounter, 6903 mSDsCounter, 0 mSdLazyCounter, 9940 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 10070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 9940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:27:55,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 7415 Invalid, 10070 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 9940 Invalid, 0 Unknown, 0 Unchecked, 20.3s Time] [2023-12-02 16:27:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2023-12-02 16:27:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1290. [2023-12-02 16:27:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 771 states have (on average 1.8326848249027237) internal successors, (1413), 1279 states have internal predecessors, (1413), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:27:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1447 transitions. [2023-12-02 16:27:55,484 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1447 transitions. Word has length 107 [2023-12-02 16:27:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:27:55,485 INFO L495 AbstractCegarLoop]: Abstraction has 1290 states and 1447 transitions. [2023-12-02 16:27:55,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 30 states have internal predecessors, (142), 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 16:27:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1447 transitions. [2023-12-02 16:27:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 16:27:55,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:27:55,486 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] [2023-12-02 16:27:55,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:27:55,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 16:27:55,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 16:27:56,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:27:56,088 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:27:56,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:27:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1406071940, now seen corresponding path program 1 times [2023-12-02 16:27:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:27:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699401509] [2023-12-02 16:27:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:27:56,089 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 16:27:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:27:56,090 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:27:56,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:27:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:27:57,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 16:27:57,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:27:57,170 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 16:27:57,257 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 16:27:57,270 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:27:57,270 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 16:27:57,294 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 16:27:57,299 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 16:27:57,405 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 16:27:57,409 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 16:27:58,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:58,063 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 16:27:58,075 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 16:27:58,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:58,184 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 16:27:58,195 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 16:27:58,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:27:58,270 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 16:27:58,280 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 16:27:58,300 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 16:27:58,305 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 16:27:58,336 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 16:27:58,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:27:58,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7329) |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~mem36#1.base| v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:27:58,517 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_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 16:27:58,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7327))) (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~mem35#1.base| v_ArrVal_7326) .cse0 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7326) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7329) |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 16:28:00,236 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7420))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7327))) (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~mem33#1.base| v_ArrVal_7421) .cse0 v_ArrVal_7326) .cse1 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7420))) (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~mem33#1.base| v_ArrVal_7421) .cse6 v_ArrVal_7326) (select (select (store .cse7 .cse6 v_ArrVal_7327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7329))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 16:28:00,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:28:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699401509] [2023-12-02 16:28:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699401509] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:28:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1521688185] [2023-12-02 16:28:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:28:00,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:28:00,253 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:28:00,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 16:29:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:01,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 16:29:01,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:29:01,969 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 16:29:02,273 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:29:02,274 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 16:29:02,285 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 16:29:02,358 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 16:29:02,368 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 16:29:02,537 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 16:29:02,542 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 16:29:03,259 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:29:03,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 16:29:03,265 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 16:29:03,459 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:29:03,460 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 16:29:03,469 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 16:29:03,584 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:29:03,584 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 16:29:03,596 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 16:29:03,612 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 16:29:03,617 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 16:29:03,623 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 16:29:03,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:29:03,681 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7891) |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~mem36#1.base| v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:29:03,718 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_7891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 16:29:03,764 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7888) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7889))) (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~mem35#1.base| v_ArrVal_7888) .cse2 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 16:29:03,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7889))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7888) .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7888) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 16:29:05,221 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7982 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7889))) (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~mem33#1.base| v_ArrVal_7982) .cse0 v_ArrVal_7888) .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7982 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7983))) (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~mem33#1.base| v_ArrVal_7982) .cse6 v_ArrVal_7888) (select (select (store .cse7 .cse6 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7891))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 16:29:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1521688185] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:29:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664014309] [2023-12-02 16:29:05,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:05,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:29:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:29:05,238 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:29:05,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 16:29:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:05,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 16:29:05,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:29:05,986 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 16:29:06,123 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:29:06,123 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 16:29:06,131 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 16:29:06,152 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 16:29:06,158 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 16:29:06,228 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 16:29:06,233 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 16:29:06,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:29:06,989 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 16:29:07,001 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 16:29:07,077 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:29:07,078 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 67 treesize of output 39 [2023-12-02 16:29:07,084 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 16:29:07,329 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-02 16:29:07,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2023-12-02 16:29:07,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16:29:07,341 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 16:29:07,357 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 16:29:07,362 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 16:29:07,369 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 16:29:07,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:29:07,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8453) |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~mem36#1.base| v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:29:07,449 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_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 16:29:07,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (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~mem35#1.base| v_ArrVal_8450) .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8450) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32))))))) is different from false [2023-12-02 16:29:11,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8545))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 (store (select .cse4 .cse0) (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (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~mem33#1.base| v_ArrVal_8544) .cse0 v_ArrVal_8450) .cse1 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8545))) (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~mem33#1.base| v_ArrVal_8544) .cse6 v_ArrVal_8450) (select (select (store .cse7 .cse6 (store (select .cse7 .cse6) (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8453))) |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 16:29:11,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664014309] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:29:11,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:29:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 18 [2023-12-02 16:29:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572425351] [2023-12-02 16:29:11,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:29:11,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 16:29:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:29:11,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 16:29:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=416, Unknown=21, NotChecked=702, Total=1260 [2023-12-02 16:29:11,848 INFO L87 Difference]: Start difference. First operand 1290 states and 1447 transitions. Second operand has 19 states, 16 states have (on average 7.6875) internal successors, (123), 19 states have internal predecessors, (123), 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 16:29:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:29:37,007 INFO L93 Difference]: Finished difference Result 1643 states and 1769 transitions. [2023-12-02 16:29:37,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:29:37,008 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.6875) internal successors, (123), 19 states have internal predecessors, (123), 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 107 [2023-12-02 16:29:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:29:37,014 INFO L225 Difference]: With dead ends: 1643 [2023-12-02 16:29:37,015 INFO L226 Difference]: Without dead ends: 1643 [2023-12-02 16:29:37,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 303 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=198, Invalid=703, Unknown=21, NotChecked=884, Total=1806 [2023-12-02 16:29:37,016 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1118 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 6104 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 6123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:29:37,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 3008 Invalid, 6123 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 6104 Invalid, 0 Unknown, 0 Unchecked, 24.4s Time] [2023-12-02 16:29:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2023-12-02 16:29:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1289. [2023-12-02 16:29:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 771 states have (on average 1.8313878080415045) internal successors, (1412), 1278 states have internal predecessors, (1412), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:29:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1446 transitions. [2023-12-02 16:29:37,043 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1446 transitions. Word has length 107 [2023-12-02 16:29:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:29:37,043 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1446 transitions. [2023-12-02 16:29:37,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.6875) internal successors, (123), 19 states have internal predecessors, (123), 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 16:29:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1446 transitions. [2023-12-02 16:29:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 16:29:37,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:29:37,045 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:29:37,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-12-02 16:29:37,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 16:29:37,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:29:37,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:29:37,646 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:29:37,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:29:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1681543265, now seen corresponding path program 1 times [2023-12-02 16:29:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:29:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942930368] [2023-12-02 16:29:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:37,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 16:29:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:29:37,648 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:29:37,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:29:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:39,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 16:29:39,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:29:39,154 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 16:29:39,387 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:29:39,387 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 16:29:39,446 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 16:29:39,600 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 16:29:40,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:29:40,996 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 16:29:41,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:29:41,175 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 16:29:41,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:29:41,312 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 16:29:41,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:29:41,480 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 16:29:41,513 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 16:29:41,587 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 16:29:41,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:29:41,700 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (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~mem37#1.base| v_ArrVal_8984) |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 16:29:41,720 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (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_8984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:29:41,741 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (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~mem36#1.base| v_ArrVal_8983))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:29:41,762 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (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_8983))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:29:41,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:29:41,812 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:29:42,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9030))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8982)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 16:29:42,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:29:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942930368] [2023-12-02 16:29:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942930368] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:29:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [432326181] [2023-12-02 16:29:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:29:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:29:42,346 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:29:42,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 16:31:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:31:10,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 16:31:10,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:31:10,219 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:31:10,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 16:31:11,002 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:31:11,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 16:31:11,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 16:31:11,501 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 28 treesize of output 16 [2023-12-02 16:31:13,729 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:13,729 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 41 [2023-12-02 16:31:14,067 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:14,068 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 41 [2023-12-02 16:31:14,307 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:14,307 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 41 [2023-12-02 16:31:14,562 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:14,562 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 41 [2023-12-02 16:31:14,600 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 35 treesize of output 19 [2023-12-02 16:31:14,726 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 16:31:14,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:31:14,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9469 (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~mem37#1.base| v_ArrVal_9469) |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 16:31:14,773 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9469 (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_9469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:31:14,799 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9468 (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~mem36#1.base| v_ArrVal_9468))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9469)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:31:14,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9469)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:31:14,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (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~mem35#1.base| v_ArrVal_9467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9469)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:31:14,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9469)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:31:15,433 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9515))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9469)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 16:31:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [432326181] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:31:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364619494] [2023-12-02 16:31:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:31:15,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:31:15,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:31:15,442 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:31:15,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 16:31:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:31:16,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 16:31:16,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:31:16,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 16:31:16,399 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:31:16,400 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 16:31:16,476 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 16:31:17,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:31:17,570 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 16:31:17,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:31:17,845 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 16:31:18,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:31:18,016 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 16:31:18,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:31:18,193 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 16:31:18,212 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 16:31:18,218 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 16:31:18,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:31:18,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9953) |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 16:31:20,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9952))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:31:20,451 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (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_9952))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:31:20,473 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (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~mem35#1.base| v_ArrVal_9951))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:31:20,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9951))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:31:21,043 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 16:31:21,043 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 109 treesize of output 108 [2023-12-02 16:31:21,066 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9999))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9951)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 16:31:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364619494] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:31:21,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:31:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2023-12-02 16:31:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177285433] [2023-12-02 16:31:21,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:31:21,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 16:31:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:31:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 16:31:21,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1081, Unknown=25, NotChecked=1740, Total=3080 [2023-12-02 16:31:21,073 INFO L87 Difference]: Start difference. First operand 1289 states and 1446 transitions. Second operand has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 33 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 16:31:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:31:54,977 INFO L93 Difference]: Finished difference Result 2408 states and 2616 transitions. [2023-12-02 16:31:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 16:31:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 33 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 109 [2023-12-02 16:31:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:31:54,981 INFO L225 Difference]: With dead ends: 2408 [2023-12-02 16:31:54,981 INFO L226 Difference]: Without dead ends: 2408 [2023-12-02 16:31:54,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=324, Invalid=1801, Unknown=25, NotChecked=2140, Total=4290 [2023-12-02 16:31:54,983 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 3135 mSDsluCounter, 6551 mSDsCounter, 0 mSdLazyCounter, 9427 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3158 SdHoareTripleChecker+Valid, 7062 SdHoareTripleChecker+Invalid, 9546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 9427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:31:54,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3158 Valid, 7062 Invalid, 9546 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 9427 Invalid, 0 Unknown, 0 Unchecked, 32.9s Time] [2023-12-02 16:31:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2023-12-02 16:31:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1288. [2023-12-02 16:31:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 771 states have (on average 1.8300907911802853) internal successors, (1411), 1277 states have internal predecessors, (1411), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 16:31:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1445 transitions. [2023-12-02 16:31:55,007 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1445 transitions. Word has length 109 [2023-12-02 16:31:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:31:55,007 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1445 transitions. [2023-12-02 16:31:55,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 33 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 16:31:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1445 transitions. [2023-12-02 16:31:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 16:31:55,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:31:55,009 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:31:55,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 16:31:55,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2023-12-02 16:31:55,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:31:55,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:31:55,610 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 16:31:55,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:31:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1681543266, now seen corresponding path program 1 times [2023-12-02 16:31:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:31:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642854636] [2023-12-02 16:31:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:31:55,611 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 16:31:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:31:55,612 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:31:55,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/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 16:31:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:31:56,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 16:31:56,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:31:56,974 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 16:31:57,415 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:31:57,415 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 16:31:57,433 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 16:31:57,474 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 16:31:57,493 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 16:31:57,674 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 16:31:57,682 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 16:31:58,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:58,861 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 16:31:58,879 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 16:31:59,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:59,072 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 16:31:59,079 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 16:31:59,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:59,242 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 16:31:59,261 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 16:31:59,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:59,411 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 16:31:59,425 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 16:31:59,449 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 16:31:59,462 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 16:31:59,520 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 16:31:59,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:31:59,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10486) |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~mem37#1.base| v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:31:59,829 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_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10486) |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 16:31:59,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10484))) (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~mem36#1.base| v_ArrVal_10483) .cse0 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10483) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10486) |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 16:32:00,203 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_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484))) (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_10483) .cse3 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 16:32:00,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10481))) (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~mem35#1.base| v_ArrVal_10482) .cse1 v_ArrVal_10483) (select (select (store .cse2 .cse1 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10486))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10481))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10484))) (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~mem35#1.base| v_ArrVal_10482) .cse4 v_ArrVal_10483) .cse5 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 16:32:02,744 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_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10481))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10482) .cse2 v_ArrVal_10483) (select (select (store .cse3 .cse2 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10486))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10481))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10484))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10482) .cse5 v_ArrVal_10483) .cse6 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 16:32:06,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10578 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10578))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10481))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10484))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10577) .cse0 v_ArrVal_10482) .cse1 v_ArrVal_10483) .cse2 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10578 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10578))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10481))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10577) .cse8 v_ArrVal_10482) .cse9 v_ArrVal_10483) (select (select (store .cse10 .cse9 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10486))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 16:32:06,939 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:32:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642854636] [2023-12-02 16:32:06,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642854636] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:32:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366421957] [2023-12-02 16:32:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:32:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:32:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:32:06,942 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:32:06,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44dffbb1-2f8e-4f07-b0fc-f048c19ad7fa/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process