./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E --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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:38:38,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:38:38,928 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:38:38,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:38:38,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:38:38,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:38:38,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:38:38,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:38:38,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:38:38,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:38:38,981 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:38:38,982 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:38:38,982 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:38:38,982 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:38:38,982 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:38:38,982 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:38:38,983 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:38:38,983 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:38:38,983 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:38:38,983 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:38:38,983 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:38:38,983 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:38:38,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:38:38,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:38:38,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:38:38,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:38:38,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:38:38,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:38:38,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:38:38,986 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:38:38,986 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:38:38,986 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:38:38,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:38:38,986 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:38:38,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:38:38,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:38:38,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:38:38,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:38:38,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:38:38,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:38:38,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:38:38,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:38:38,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:38:38,989 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-14 05:38:39,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:38:39,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:38:39,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:38:39,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:38:39,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:38:39,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i Unable to find full path for "g++" [2024-11-14 05:38:41,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:38:42,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:38:42,245 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-14 05:38:42,274 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data/c01e2fcf6/de3a6afa0221476191ac46203c14b92c/FLAG4ba0a85ae [2024-11-14 05:38:42,301 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data/c01e2fcf6/de3a6afa0221476191ac46203c14b92c [2024-11-14 05:38:42,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:38:42,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:38:42,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:38:42,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:38:42,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:38:42,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:38:42" (1/1) ... [2024-11-14 05:38:42,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1438bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:42, skipping insertion in model container [2024-11-14 05:38:42,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:38:42" (1/1) ... [2024-11-14 05:38:42,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:38:42,967 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,011 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,016 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,021 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,032 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,075 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,081 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,085 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,089 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,090 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,104 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:43,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:38:43,135 ERROR L321 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) [2024-11-14 05:38:43,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7dcb5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:43, skipping insertion in model container [2024-11-14 05:38:43,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:38:43,136 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-14 05:38:43,139 INFO L158 Benchmark]: Toolchain (without parser) took 831.29ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 72.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:38:43,139 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 83.9MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:38:43,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 826.33ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 72.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:38:43,141 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.55ms. Allocated memory is still 83.9MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 826.33ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 72.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E --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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:38:46,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:38:46,486 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 05:38:46,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:38:46,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:38:46,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:38:46,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:38:46,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:38:46,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:38:46,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:38:46,567 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:38:46,567 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:38:46,567 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:38:46,567 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:38:46,567 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:38:46,567 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:38:46,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:38:46,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:38:46,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:38:46,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:38:46,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:38:46,569 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:38:46,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:38:46,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:38:46,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:38:46,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:38:46,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:38:46,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:38:46,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:38:46,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:38:46,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:38:46,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:38:46,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:38:46,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:38:46,571 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:38:46,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:38:46,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:38:46,572 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:38:46,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-14 05:38:46,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:38:46,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:38:46,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:38:46,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:38:46,978 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:38:46,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i Unable to find full path for "g++" [2024-11-14 05:38:49,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:38:49,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:38:49,953 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-14 05:38:49,983 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data/b05f5b687/97bf993427bb46579b6c7973f354fb6f/FLAGc9e9a6bec [2024-11-14 05:38:50,464 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/data/b05f5b687/97bf993427bb46579b6c7973f354fb6f [2024-11-14 05:38:50,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:38:50,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:38:50,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:38:50,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:38:50,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:38:50,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:38:50" (1/1) ... [2024-11-14 05:38:50,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0b3ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:50, skipping insertion in model container [2024-11-14 05:38:50,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:38:50" (1/1) ... [2024-11-14 05:38:50,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:38:51,034 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,077 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,083 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,095 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,120 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,159 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,163 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,167 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,177 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,183 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:38:51,210 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-14 05:38:51,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:38:51,272 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,297 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,301 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,305 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,321 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,349 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,353 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,361 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,362 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,368 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,369 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,378 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:38:51,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:38:51,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:38:51,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:38:51,584 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:38:51,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51 WrapperNode [2024-11-14 05:38:51,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:38:51,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:38:51,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:38:51,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:38:51,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,706 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 739 [2024-11-14 05:38:51,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:38:51,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:38:51,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:38:51,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:38:51,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:38:51,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:38:51,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:38:51,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:38:51,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (1/1) ... [2024-11-14 05:38:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:38:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:51,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:38:51,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:38:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 05:38:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:38:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 05:38:51,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 05:38:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:38:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:38:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:38:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:38:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:38:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:38:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:38:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:38:51,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:38:52,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:38:52,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:38:52,266 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 05:38:57,047 INFO L? ?]: Removed 890 outVars from TransFormulas that were not future-live. [2024-11-14 05:38:57,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:38:57,083 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:38:57,084 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-14 05:38:57,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:38:57 BoogieIcfgContainer [2024-11-14 05:38:57,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:38:57,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:38:57,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:38:57,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:38:57,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:38:50" (1/3) ... [2024-11-14 05:38:57,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433536be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:38:57, skipping insertion in model container [2024-11-14 05:38:57,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:51" (2/3) ... [2024-11-14 05:38:57,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433536be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:38:57, skipping insertion in model container [2024-11-14 05:38:57,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:38:57" (3/3) ... [2024-11-14 05:38:57,109 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-2.i [2024-11-14 05:38:57,131 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:38:57,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test1-2.i that has 2 procedures, 836 locations, 1 initial locations, 24 loop locations, and 425 error locations. [2024-11-14 05:38:57,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:38:57,256 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5566bb43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:38:57,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-14 05:38:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 409 states have (on average 2.234718826405868) internal successors, (914), 831 states have internal predecessors, (914), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:38:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:38:57,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:57,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:38:57,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:38:57,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2024-11-14 05:38:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:38:57,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670399094] [2024-11-14 05:38:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:57,302 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 [2024-11-14 05:38:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:38:57,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:38:57,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:38:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:57,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:38:57,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:57,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:38:57,574 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:38:57,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670399094] [2024-11-14 05:38:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670399094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:38:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647548525] [2024-11-14 05:38:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:57,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:38:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:38:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:38:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:38:57,628 INFO L87 Difference]: Start difference. First operand has 836 states, 409 states have (on average 2.234718826405868) internal successors, (914), 831 states have internal predecessors, (914), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:38:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:57,703 INFO L93 Difference]: Finished difference Result 826 states and 864 transitions. [2024-11-14 05:38:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:38:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:38:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:57,726 INFO L225 Difference]: With dead ends: 826 [2024-11-14 05:38:57,726 INFO L226 Difference]: Without dead ends: 824 [2024-11-14 05:38:57,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:38:57,733 INFO L432 NwaCegarLoop]: 864 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:57,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:38:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-14 05:38:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-14 05:38:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 403 states have (on average 2.1240694789081886) internal successors, (856), 819 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:38:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 862 transitions. [2024-11-14 05:38:57,854 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 862 transitions. Word has length 5 [2024-11-14 05:38:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:57,855 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 862 transitions. [2024-11-14 05:38:57,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:38:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 862 transitions. [2024-11-14 05:38:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:38:57,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:57,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:38:57,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 05:38:58,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:38:58,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:38:58,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2024-11-14 05:38:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:38:58,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156450370] [2024-11-14 05:38:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:58,058 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 [2024-11-14 05:38:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:38:58,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:38:58,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:38:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:58,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:38:58,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:58,253 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 [2024-11-14 05:38:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:58,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:38:58,280 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:38:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156450370] [2024-11-14 05:38:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156450370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:38:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525335254] [2024-11-14 05:38:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:58,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:38:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:38:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:38:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:38:58,286 INFO L87 Difference]: Start difference. First operand 824 states and 862 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:00,478 INFO L93 Difference]: Finished difference Result 777 states and 816 transitions. [2024-11-14 05:39:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:39:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:00,485 INFO L225 Difference]: With dead ends: 777 [2024-11-14 05:39:00,488 INFO L226 Difference]: Without dead ends: 777 [2024-11-14 05:39:00,488 INFO L431 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 [2024-11-14 05:39:00,489 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 516 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:00,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 618 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 05:39:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-14 05:39:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 775. [2024-11-14 05:39:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 403 states have (on average 2.002481389578164) internal successors, (807), 770 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 813 transitions. [2024-11-14 05:39:00,520 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 813 transitions. Word has length 5 [2024-11-14 05:39:00,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:00,520 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 813 transitions. [2024-11-14 05:39:00,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 813 transitions. [2024-11-14 05:39:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:39:00,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:00,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:39:00,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:00,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:00,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:00,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2024-11-14 05:39:00,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:00,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939134304] [2024-11-14 05:39:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:00,723 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 [2024-11-14 05:39:00,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:00,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:00,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:00,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:39:00,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:00,867 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 [2024-11-14 05:39:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:00,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:00,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939134304] [2024-11-14 05:39:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939134304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:39:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94036644] [2024-11-14 05:39:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:00,905 INFO L87 Difference]: Start difference. First operand 775 states and 813 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:03,272 INFO L93 Difference]: Finished difference Result 849 states and 891 transitions. [2024-11-14 05:39:03,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:03,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:39:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:03,277 INFO L225 Difference]: With dead ends: 849 [2024-11-14 05:39:03,277 INFO L226 Difference]: Without dead ends: 849 [2024-11-14 05:39:03,277 INFO L431 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 [2024-11-14 05:39:03,278 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 267 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:03,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 964 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 05:39:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-14 05:39:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 801. [2024-11-14 05:39:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 440 states have (on average 1.9772727272727273) internal successors, (870), 796 states have internal predecessors, (870), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 876 transitions. [2024-11-14 05:39:03,305 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 876 transitions. Word has length 5 [2024-11-14 05:39:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:03,305 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 876 transitions. [2024-11-14 05:39:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 876 transitions. [2024-11-14 05:39:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:39:03,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:03,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:39:03,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 05:39:03,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:03,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:03,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1156715246, now seen corresponding path program 1 times [2024-11-14 05:39:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652835040] [2024-11-14 05:39:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:03,508 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 [2024-11-14 05:39:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:03,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:03,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:03,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:39:03,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:03,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:03,631 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:03,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652835040] [2024-11-14 05:39:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652835040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884853596] [2024-11-14 05:39:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:03,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:03,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:03,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:03,633 INFO L87 Difference]: Start difference. First operand 801 states and 876 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:03,701 INFO L93 Difference]: Finished difference Result 1378 states and 1516 transitions. [2024-11-14 05:39:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:39:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:03,709 INFO L225 Difference]: With dead ends: 1378 [2024-11-14 05:39:03,709 INFO L226 Difference]: Without dead ends: 1378 [2024-11-14 05:39:03,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:03,710 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 559 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:03,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1596 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:39:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-14 05:39:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 802. [2024-11-14 05:39:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 441 states have (on average 1.9750566893424035) internal successors, (871), 797 states have internal predecessors, (871), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 877 transitions. [2024-11-14 05:39:03,743 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 877 transitions. Word has length 6 [2024-11-14 05:39:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:03,743 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 877 transitions. [2024-11-14 05:39:03,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 877 transitions. [2024-11-14 05:39:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:39:03,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:03,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:03,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:03,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:03,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:03,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 47654045, now seen corresponding path program 1 times [2024-11-14 05:39:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:03,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797049291] [2024-11-14 05:39:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:03,948 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 [2024-11-14 05:39:03,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:03,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:03,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:04,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:39:04,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:04,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:04,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:04,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797049291] [2024-11-14 05:39:04,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797049291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:04,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:04,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367481198] [2024-11-14 05:39:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:04,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:04,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:04,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:04,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:04,136 INFO L87 Difference]: Start difference. First operand 802 states and 877 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:04,191 INFO L93 Difference]: Finished difference Result 760 states and 834 transitions. [2024-11-14 05:39:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 05:39:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:04,196 INFO L225 Difference]: With dead ends: 760 [2024-11-14 05:39:04,196 INFO L226 Difference]: Without dead ends: 760 [2024-11-14 05:39:04,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:04,200 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 71 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:04,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:39:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-14 05:39:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2024-11-14 05:39:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 423 states have (on average 1.9574468085106382) internal successors, (828), 755 states have internal predecessors, (828), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 834 transitions. [2024-11-14 05:39:04,226 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 834 transitions. Word has length 15 [2024-11-14 05:39:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:04,226 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 834 transitions. [2024-11-14 05:39:04,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 834 transitions. [2024-11-14 05:39:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:39:04,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:04,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:04,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 05:39:04,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:04,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1449108010, now seen corresponding path program 1 times [2024-11-14 05:39:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109610927] [2024-11-14 05:39:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:04,430 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 [2024-11-14 05:39:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:04,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:04,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:04,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:39:04,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:04,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:04,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109610927] [2024-11-14 05:39:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109610927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:04,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:39:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452201334] [2024-11-14 05:39:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:04,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:04,619 INFO L87 Difference]: Start difference. First operand 760 states and 834 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:04,751 INFO L93 Difference]: Finished difference Result 738 states and 805 transitions. [2024-11-14 05:39:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:39:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 05:39:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:04,755 INFO L225 Difference]: With dead ends: 738 [2024-11-14 05:39:04,755 INFO L226 Difference]: Without dead ends: 738 [2024-11-14 05:39:04,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:39:04,757 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 48 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:04,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2080 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:39:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-14 05:39:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-14 05:39:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 415 states have (on average 1.925301204819277) internal successors, (799), 733 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 805 transitions. [2024-11-14 05:39:04,785 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 805 transitions. Word has length 17 [2024-11-14 05:39:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:04,785 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 805 transitions. [2024-11-14 05:39:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 805 transitions. [2024-11-14 05:39:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:39:04,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:04,787 INFO L215 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] [2024-11-14 05:39:04,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 05:39:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:04,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -527979420, now seen corresponding path program 1 times [2024-11-14 05:39:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402519576] [2024-11-14 05:39:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:04,991 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 [2024-11-14 05:39:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:04,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:05,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:05,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:39:05,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:05,193 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 [2024-11-14 05:39:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:05,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:05,331 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402519576] [2024-11-14 05:39:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402519576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:05,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614380644] [2024-11-14 05:39:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:05,334 INFO L87 Difference]: Start difference. First operand 738 states and 805 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:07,853 INFO L93 Difference]: Finished difference Result 738 states and 805 transitions. [2024-11-14 05:39:07,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:39:07,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 05:39:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:07,858 INFO L225 Difference]: With dead ends: 738 [2024-11-14 05:39:07,858 INFO L226 Difference]: Without dead ends: 738 [2024-11-14 05:39:07,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:39:07,859 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 449 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:07,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 881 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:39:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-14 05:39:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 734. [2024-11-14 05:39:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 415 states have (on average 1.9156626506024097) internal successors, (795), 729 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 801 transitions. [2024-11-14 05:39:07,881 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 801 transitions. Word has length 31 [2024-11-14 05:39:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:07,881 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 801 transitions. [2024-11-14 05:39:07,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 801 transitions. [2024-11-14 05:39:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:39:07,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:07,882 INFO L215 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] [2024-11-14 05:39:07,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:08,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:08,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash -527979419, now seen corresponding path program 1 times [2024-11-14 05:39:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766368200] [2024-11-14 05:39:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:08,085 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 [2024-11-14 05:39:08,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:08,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:08,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:08,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:39:08,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:08,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:39:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:08,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:08,625 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766368200] [2024-11-14 05:39:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766368200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106027180] [2024-11-14 05:39:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:08,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:08,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:08,626 INFO L87 Difference]: Start difference. First operand 734 states and 801 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:11,476 INFO L93 Difference]: Finished difference Result 782 states and 816 transitions. [2024-11-14 05:39:11,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:39:11,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 05:39:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:11,479 INFO L225 Difference]: With dead ends: 782 [2024-11-14 05:39:11,479 INFO L226 Difference]: Without dead ends: 782 [2024-11-14 05:39:11,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:39:11,480 INFO L432 NwaCegarLoop]: 637 mSDtfsCounter, 196 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:11,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1244 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 05:39:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-14 05:39:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 730. [2024-11-14 05:39:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 415 states have (on average 1.9060240963855422) internal successors, (791), 725 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 797 transitions. [2024-11-14 05:39:11,497 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 797 transitions. Word has length 31 [2024-11-14 05:39:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 797 transitions. [2024-11-14 05:39:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 797 transitions. [2024-11-14 05:39:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 05:39:11,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:11,498 INFO L215 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] [2024-11-14 05:39:11,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:11,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:11,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2001328572, now seen corresponding path program 1 times [2024-11-14 05:39:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341315148] [2024-11-14 05:39:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:11,702 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 [2024-11-14 05:39:11,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:11,705 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:11,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:11,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:39:11,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:11,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:11,981 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341315148] [2024-11-14 05:39:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341315148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:11,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:39:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729860743] [2024-11-14 05:39:11,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:11,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:11,982 INFO L87 Difference]: Start difference. First operand 730 states and 797 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:12,059 INFO L93 Difference]: Finished difference Result 724 states and 787 transitions. [2024-11-14 05:39:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:39:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-14 05:39:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:12,062 INFO L225 Difference]: With dead ends: 724 [2024-11-14 05:39:12,062 INFO L226 Difference]: Without dead ends: 724 [2024-11-14 05:39:12,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:39:12,063 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 21 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:12,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:39:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-14 05:39:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2024-11-14 05:39:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 409 states have (on average 1.9095354523227384) internal successors, (781), 719 states have internal predecessors, (781), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 787 transitions. [2024-11-14 05:39:12,078 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 787 transitions. Word has length 47 [2024-11-14 05:39:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:12,079 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 787 transitions. [2024-11-14 05:39:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 787 transitions. [2024-11-14 05:39:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 05:39:12,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:12,080 INFO L215 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] [2024-11-14 05:39:12,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:12,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:12,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:12,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 675533448, now seen corresponding path program 1 times [2024-11-14 05:39:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:12,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573520607] [2024-11-14 05:39:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:12,282 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 [2024-11-14 05:39:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:12,285 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:12,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:12,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:39:12,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:13,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:13,002 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573520607] [2024-11-14 05:39:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573520607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263811275] [2024-11-14 05:39:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:13,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:13,005 INFO L87 Difference]: Start difference. First operand 724 states and 787 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:13,344 INFO L93 Difference]: Finished difference Result 945 states and 1037 transitions. [2024-11-14 05:39:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:13,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-14 05:39:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:13,349 INFO L225 Difference]: With dead ends: 945 [2024-11-14 05:39:13,349 INFO L226 Difference]: Without dead ends: 945 [2024-11-14 05:39:13,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:13,351 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 177 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1428 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:39:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-14 05:39:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 775. [2024-11-14 05:39:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 460 states have (on average 1.808695652173913) internal successors, (832), 770 states have internal predecessors, (832), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 838 transitions. [2024-11-14 05:39:13,371 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 838 transitions. Word has length 55 [2024-11-14 05:39:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:13,371 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 838 transitions. [2024-11-14 05:39:13,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 838 transitions. [2024-11-14 05:39:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 05:39:13,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:13,373 INFO L215 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] [2024-11-14 05:39:13,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:13,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:13,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:13,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1507279472, now seen corresponding path program 1 times [2024-11-14 05:39:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:13,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352272428] [2024-11-14 05:39:13,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:13,575 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 [2024-11-14 05:39:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:13,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:13,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:13,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:39:13,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:14,016 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 [2024-11-14 05:39:14,027 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 [2024-11-14 05:39:14,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:39:14,895 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 [2024-11-14 05:39:14,924 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:39:14,924 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 [2024-11-14 05:39:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:14,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:14,949 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352272428] [2024-11-14 05:39:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352272428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409448365] [2024-11-14 05:39:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:14,951 INFO L87 Difference]: Start difference. First operand 775 states and 838 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:17,232 INFO L93 Difference]: Finished difference Result 737 states and 800 transitions. [2024-11-14 05:39:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:39:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-14 05:39:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:17,236 INFO L225 Difference]: With dead ends: 737 [2024-11-14 05:39:17,237 INFO L226 Difference]: Without dead ends: 737 [2024-11-14 05:39:17,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:17,237 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 374 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:17,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 553 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:39:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-14 05:39:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 700. [2024-11-14 05:39:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 423 states have (on average 1.702127659574468) internal successors, (720), 695 states have internal predecessors, (720), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 726 transitions. [2024-11-14 05:39:17,255 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 726 transitions. Word has length 58 [2024-11-14 05:39:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:17,255 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 726 transitions. [2024-11-14 05:39:17,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 726 transitions. [2024-11-14 05:39:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:39:17,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:17,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:17,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-14 05:39:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:17,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2035988571, now seen corresponding path program 1 times [2024-11-14 05:39:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646794630] [2024-11-14 05:39:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:17,460 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 [2024-11-14 05:39:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:17,462 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:17,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:17,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:39:17,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:17,801 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 [2024-11-14 05:39:17,826 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 [2024-11-14 05:39:17,868 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 [2024-11-14 05:39:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:17,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:17,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646794630] [2024-11-14 05:39:17,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646794630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:39:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699025861] [2024-11-14 05:39:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:17,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:39:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:17,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:39:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:39:17,887 INFO L87 Difference]: Start difference. First operand 700 states and 726 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:20,452 INFO L93 Difference]: Finished difference Result 699 states and 725 transitions. [2024-11-14 05:39:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:39:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-14 05:39:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:20,456 INFO L225 Difference]: With dead ends: 699 [2024-11-14 05:39:20,456 INFO L226 Difference]: Without dead ends: 699 [2024-11-14 05:39:20,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:39:20,457 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 2 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:20,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1676 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:39:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-14 05:39:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-14 05:39:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 694 states have internal predecessors, (719), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 725 transitions. [2024-11-14 05:39:20,474 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 725 transitions. Word has length 63 [2024-11-14 05:39:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:20,474 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 725 transitions. [2024-11-14 05:39:20,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 725 transitions. [2024-11-14 05:39:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:39:20,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:20,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:20,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-14 05:39:20,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:20,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:20,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2035988572, now seen corresponding path program 1 times [2024-11-14 05:39:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240719641] [2024-11-14 05:39:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:20,679 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 [2024-11-14 05:39:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:20,681 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:20,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:21,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:39:21,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:21,040 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 [2024-11-14 05:39:21,071 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 [2024-11-14 05:39:21,081 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 [2024-11-14 05:39:21,165 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 [2024-11-14 05:39:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:21,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:21,197 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240719641] [2024-11-14 05:39:21,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240719641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:21,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:39:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798916781] [2024-11-14 05:39:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:21,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:39:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:21,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:39:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:39:21,200 INFO L87 Difference]: Start difference. First operand 699 states and 725 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:24,889 INFO L93 Difference]: Finished difference Result 698 states and 724 transitions. [2024-11-14 05:39:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:39:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-14 05:39:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:24,893 INFO L225 Difference]: With dead ends: 698 [2024-11-14 05:39:24,893 INFO L226 Difference]: Without dead ends: 698 [2024-11-14 05:39:24,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:39:24,894 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 1 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:24,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1701 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 05:39:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-14 05:39:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-14 05:39:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 422 states have (on average 1.7014218009478672) internal successors, (718), 693 states have internal predecessors, (718), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:39:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 724 transitions. [2024-11-14 05:39:24,910 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 724 transitions. Word has length 63 [2024-11-14 05:39:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:24,911 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 724 transitions. [2024-11-14 05:39:24,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 724 transitions. [2024-11-14 05:39:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 05:39:24,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:24,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:24,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:25,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:25,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:25,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1647677922, now seen corresponding path program 1 times [2024-11-14 05:39:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70867671] [2024-11-14 05:39:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:25,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:25,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:25,121 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:25,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:25,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:39:25,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:25,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:39:25,475 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70867671] [2024-11-14 05:39:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70867671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:25,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:39:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305353077] [2024-11-14 05:39:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:25,478 INFO L87 Difference]: Start difference. First operand 698 states and 724 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-14 05:39:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:25,527 INFO L93 Difference]: Finished difference Result 701 states and 728 transitions. [2024-11-14 05:39:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:39:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 71 [2024-11-14 05:39:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:25,532 INFO L225 Difference]: With dead ends: 701 [2024-11-14 05:39:25,532 INFO L226 Difference]: Without dead ends: 701 [2024-11-14 05:39:25,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:25,533 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 0 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:25,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2002 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:39:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-14 05:39:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-11-14 05:39:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 424 states have (on average 1.7004716981132075) internal successors, (721), 696 states have internal predecessors, (721), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:39:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 728 transitions. [2024-11-14 05:39:25,554 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 728 transitions. Word has length 71 [2024-11-14 05:39:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:25,555 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 728 transitions. [2024-11-14 05:39:25,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-14 05:39:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 728 transitions. [2024-11-14 05:39:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-14 05:39:25,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:25,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:25,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-14 05:39:25,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:25,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:25,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 933339861, now seen corresponding path program 1 times [2024-11-14 05:39:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955284424] [2024-11-14 05:39:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:25,758 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 [2024-11-14 05:39:25,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:25,760 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:25,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:26,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:39:26,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:26,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:26,255 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955284424] [2024-11-14 05:39:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955284424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:39:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1007945286] [2024-11-14 05:39:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:39:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:39:26,261 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:39:26,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-14 05:39:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:26,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:39:26,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:26,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1007945286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:39:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720998535] [2024-11-14 05:39:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:26,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:26,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:26,898 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:39:26,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 05:39:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:27,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:39:27,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:27,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720998535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:39:27,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:39:27,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-14 05:39:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886342399] [2024-11-14 05:39:27,348 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:39:27,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:39:27,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:27,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:39:27,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:39:27,351 INFO L87 Difference]: Start difference. First operand 701 states and 728 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2024-11-14 05:39:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:27,600 INFO L93 Difference]: Finished difference Result 713 states and 745 transitions. [2024-11-14 05:39:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:39:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 72 [2024-11-14 05:39:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:27,605 INFO L225 Difference]: With dead ends: 713 [2024-11-14 05:39:27,605 INFO L226 Difference]: Without dead ends: 713 [2024-11-14 05:39:27,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:39:27,606 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 7 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:27,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2667 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:39:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-14 05:39:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 711. [2024-11-14 05:39:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 433 states have (on average 1.699769053117783) internal successors, (736), 705 states have internal predecessors, (736), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:39:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 743 transitions. [2024-11-14 05:39:27,629 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 743 transitions. Word has length 72 [2024-11-14 05:39:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:27,631 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 743 transitions. [2024-11-14 05:39:27,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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) [2024-11-14 05:39:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 743 transitions. [2024-11-14 05:39:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 05:39:27,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:27,633 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:27,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-14 05:39:27,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-14 05:39:28,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 05:39:28,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:28,238 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:39:28,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1697363618, now seen corresponding path program 2 times [2024-11-14 05:39:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448444352] [2024-11-14 05:39:28,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:39:28,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:28,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:28,244 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:39:28,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:39:28,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:39:28,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:39:28,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:39:28,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:28,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:29,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448444352] [2024-11-14 05:39:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448444352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:39:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873896046] [2024-11-14 05:39:29,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:39:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:39:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:39:29,118 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:39:29,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-14 05:39:30,294 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:39:30,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:39:30,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:39:30,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:30,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [873896046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:39:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716461654] [2024-11-14 05:39:30,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:39:30,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:30,450 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:39:30,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 05:39:50,573 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:39:50,573 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:39:50,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:39:50,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:50,844 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:39:50,845 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 [2024-11-14 05:39:50,903 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 [2024-11-14 05:39:51,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:39:51,286 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 [2024-11-14 05:39:51,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:39:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:39:51,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:51,572 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 05:39:51,573 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 [2024-11-14 05:39:51,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1257) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-14 05:39:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716461654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:51,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 05:39:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2024-11-14 05:39:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324693203] [2024-11-14 05:39:51,599 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 05:39:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:39:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:39:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:39:51,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-14 05:39:51,601 INFO L87 Difference]: Start difference. First operand 711 states and 743 transitions. Second operand has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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) [2024-11-14 05:40:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:03,618 INFO L93 Difference]: Finished difference Result 727 states and 766 transitions. [2024-11-14 05:40:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 05:40:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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 75 [2024-11-14 05:40:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:03,624 INFO L225 Difference]: With dead ends: 727 [2024-11-14 05:40:03,624 INFO L226 Difference]: Without dead ends: 723 [2024-11-14 05:40:03,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=413, Invalid=2242, Unknown=1, NotChecked=100, Total=2756 [2024-11-14 05:40:03,625 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 427 mSDsluCounter, 5618 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 6064 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:03,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 6064 Invalid, 4539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 4510 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-14 05:40:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-14 05:40:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 719. [2024-11-14 05:40:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 442 states have (on average 1.6900452488687783) internal successors, (747), 713 states have internal predecessors, (747), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:40:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 754 transitions. [2024-11-14 05:40:03,644 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 754 transitions. Word has length 75 [2024-11-14 05:40:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:03,644 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 754 transitions. [2024-11-14 05:40:03,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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) [2024-11-14 05:40:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 754 transitions. [2024-11-14 05:40:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-14 05:40:03,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:03,646 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:03,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-14 05:40:03,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 05:40:04,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-14 05:40:04,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:40:04,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:40:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1389413949, now seen corresponding path program 1 times [2024-11-14 05:40:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:40:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102827179] [2024-11-14 05:40:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:04,249 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 [2024-11-14 05:40:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:40:04,253 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:40:04,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:40:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:04,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:40:04,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:04,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:05,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:40:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102827179] [2024-11-14 05:40:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102827179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:40:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1138882729] [2024-11-14 05:40:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:05,671 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:40:05,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:40:05,674 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:40:05,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-14 05:40:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:06,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:40:06,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:06,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1138882729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:40:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015985060] [2024-11-14 05:40:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:06,575 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:06,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 05:40:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:06,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:40:06,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:07,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015985060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:40:08,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:40:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-14 05:40:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155100615] [2024-11-14 05:40:08,097 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:40:08,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 05:40:08,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:40:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 05:40:08,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:40:08,099 INFO L87 Difference]: Start difference. First operand 719 states and 754 transitions. Second operand has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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) [2024-11-14 05:40:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:10,922 INFO L93 Difference]: Finished difference Result 745 states and 795 transitions. [2024-11-14 05:40:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 05:40:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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 81 [2024-11-14 05:40:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:10,931 INFO L225 Difference]: With dead ends: 745 [2024-11-14 05:40:10,931 INFO L226 Difference]: Without dead ends: 739 [2024-11-14 05:40:10,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 05:40:10,935 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 21 mSDsluCounter, 9320 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9989 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:10,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9989 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 05:40:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-14 05:40:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2024-11-14 05:40:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 460 states have (on average 1.673913043478261) internal successors, (770), 731 states have internal predecessors, (770), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:40:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 777 transitions. [2024-11-14 05:40:10,958 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 777 transitions. Word has length 81 [2024-11-14 05:40:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 777 transitions. [2024-11-14 05:40:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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) [2024-11-14 05:40:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 777 transitions. [2024-11-14 05:40:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-14 05:40:10,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:10,960 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:10,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 05:40:11,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-14 05:40:11,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-14 05:40:11,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:40:11,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:40:11,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1279506435, now seen corresponding path program 2 times [2024-11-14 05:40:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:40:11,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835464875] [2024-11-14 05:40:11,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:40:11,562 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 [2024-11-14 05:40:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:40:11,566 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:40:11,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:40:12,148 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:40:12,149 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:40:12,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:40:12,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:12,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:15,062 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:40:15,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835464875] [2024-11-14 05:40:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835464875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:40:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1770732869] [2024-11-14 05:40:15,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:40:15,063 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:40:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:40:15,067 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:40:15,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 05:40:16,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:40:16,467 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:40:16,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:40:16,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:16,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1770732869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:40:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471530189] [2024-11-14 05:40:16,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:40:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:16,933 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:16,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 05:40:40,950 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:40:40,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:40:40,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 05:40:40,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:41,297 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 [2024-11-14 05:40:41,314 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:40:41,315 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 [2024-11-14 05:40:41,456 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 [2024-11-14 05:40:41,466 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 [2024-11-14 05:40:41,890 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 [2024-11-14 05:40:41,898 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 [2024-11-14 05:40:42,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:40:42,810 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 [2024-11-14 05:40:42,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:40:43,045 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 [2024-11-14 05:40:43,055 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 [2024-11-14 05:40:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-14 05:40:43,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471530189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:45,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 05:40:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2024-11-14 05:40:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186106787] [2024-11-14 05:40:45,106 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 05:40:45,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-14 05:40:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:40:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-14 05:40:45,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=2932, Unknown=28, NotChecked=0, Total=3660 [2024-11-14 05:40:45,110 INFO L87 Difference]: Start difference. First operand 737 states and 777 transitions. Second operand has 58 states, 57 states have (on average 3.0701754385964914) internal successors, (175), 58 states have internal predecessors, (175), 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) [2024-11-14 05:41:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:23,806 INFO L93 Difference]: Finished difference Result 780 states and 850 transitions. [2024-11-14 05:41:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-14 05:41:23,807 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.0701754385964914) internal successors, (175), 58 states have internal predecessors, (175), 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 93 [2024-11-14 05:41:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:23,811 INFO L225 Difference]: With dead ends: 780 [2024-11-14 05:41:23,811 INFO L226 Difference]: Without dead ends: 772 [2024-11-14 05:41:23,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3207 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=3108, Invalid=15217, Unknown=35, NotChecked=0, Total=18360 [2024-11-14 05:41:23,817 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 447 mSDsluCounter, 11984 mSDsCounter, 0 mSdLazyCounter, 10188 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 12430 SdHoareTripleChecker+Invalid, 10242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 10188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:23,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 12430 Invalid, 10242 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 10188 Invalid, 0 Unknown, 0 Unchecked, 27.0s Time] [2024-11-14 05:41:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-14 05:41:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2024-11-14 05:41:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 494 states have (on average 1.6417004048582995) internal successors, (811), 764 states have internal predecessors, (811), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:41:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 818 transitions. [2024-11-14 05:41:23,841 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 818 transitions. Word has length 93 [2024-11-14 05:41:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:23,842 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 818 transitions. [2024-11-14 05:41:23,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.0701754385964914) internal successors, (175), 58 states have internal predecessors, (175), 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) [2024-11-14 05:41:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 818 transitions. [2024-11-14 05:41:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 05:41:23,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:23,844 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:23,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 05:41:24,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:41:24,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-14 05:41:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:24,445 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:41:24,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1538876695, now seen corresponding path program 1 times [2024-11-14 05:41:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:41:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901295709] [2024-11-14 05:41:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:24,446 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 [2024-11-14 05:41:24,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:41:24,451 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:41:24,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:41:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:25,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 05:41:25,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:25,459 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 [2024-11-14 05:41:25,690 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:41:25,690 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 [2024-11-14 05:41:25,733 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 [2024-11-14 05:41:25,898 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 [2024-11-14 05:41:27,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:41:27,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:27,363 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 [2024-11-14 05:41:27,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 33 treesize of output 15 [2024-11-14 05:41:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:41:27,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:27,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2862) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-14 05:41:28,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2862 (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~mem33#1.base| v_ArrVal_2908))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:41:28,125 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:41:28,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901295709] [2024-11-14 05:41:28,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901295709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:28,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1522803324] [2024-11-14 05:41:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:28,125 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:41:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:41:28,127 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:41:28,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 05:41:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:31,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 05:41:31,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:31,588 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:41:31,588 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 [2024-11-14 05:41:32,047 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:41:32,048 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 [2024-11-14 05:41:32,177 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 19 treesize of output 1 [2024-11-14 05:41:32,568 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 34 treesize of output 16 [2024-11-14 05:41:34,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:34,489 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 54 treesize of output 51 [2024-11-14 05:41:34,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:34,751 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 54 treesize of output 51 [2024-11-14 05:41:34,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-14 05:41:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:41:34,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:35,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3360 (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~mem33#1.base| v_ArrVal_3360))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:41:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1522803324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442230452] [2024-11-14 05:41:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:35,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:35,468 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:35,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 05:41:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:36,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-14 05:41:36,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:36,309 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:41:36,310 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 [2024-11-14 05:41:36,366 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 [2024-11-14 05:41:37,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:37,248 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 [2024-11-14 05:41:37,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:37,498 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 [2024-11-14 05:41:37,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:41:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:41:37,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:37,557 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3764 (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_3764) |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 [2024-11-14 05:41:37,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:41:38,126 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-14 05:41:38,126 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 [2024-11-14 05:41:38,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3810 (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_3810))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3764)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-14 05:41:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442230452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:38,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2024-11-14 05:41:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115678289] [2024-11-14 05:41:38,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:38,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:41:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:41:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:41:38,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=736, Unknown=13, NotChecked=366, Total=1260 [2024-11-14 05:41:38,144 INFO L87 Difference]: Start difference. First operand 770 states and 818 transitions. Second operand has 28 states, 24 states have (on average 7.041666666666667) internal successors, (169), 27 states have internal predecessors, (169), 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) [2024-11-14 05:41:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:52,415 INFO L93 Difference]: Finished difference Result 1419 states and 1512 transitions. [2024-11-14 05:41:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 05:41:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 7.041666666666667) internal successors, (169), 27 states have internal predecessors, (169), 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 118 [2024-11-14 05:41:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:52,422 INFO L225 Difference]: With dead ends: 1419 [2024-11-14 05:41:52,423 INFO L226 Difference]: Without dead ends: 1419 [2024-11-14 05:41:52,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=221, Invalid=1272, Unknown=13, NotChecked=474, Total=1980 [2024-11-14 05:41:52,424 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 898 mSDsluCounter, 4724 mSDsCounter, 0 mSdLazyCounter, 5247 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 5076 SdHoareTripleChecker+Invalid, 5267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:52,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 5076 Invalid, 5267 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5247 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2024-11-14 05:41:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2024-11-14 05:41:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 769. [2024-11-14 05:41:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 494 states have (on average 1.639676113360324) internal successors, (810), 763 states have internal predecessors, (810), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:41:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 817 transitions. [2024-11-14 05:41:52,449 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 817 transitions. Word has length 118 [2024-11-14 05:41:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:52,449 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 817 transitions. [2024-11-14 05:41:52,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 7.041666666666667) internal successors, (169), 27 states have internal predecessors, (169), 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) [2024-11-14 05:41:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 817 transitions. [2024-11-14 05:41:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 05:41:52,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:52,451 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:52,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 05:41:52,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:41:52,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 05:41:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:53,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:41:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1538876696, now seen corresponding path program 1 times [2024-11-14 05:41:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:41:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351955373] [2024-11-14 05:41:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:41:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:41:53,056 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:41:53,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:41:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:54,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-14 05:41:54,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:54,157 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 [2024-11-14 05:41:54,360 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:41:54,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 13 treesize of output 13 [2024-11-14 05:41:54,369 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 [2024-11-14 05:41:54,399 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 [2024-11-14 05:41:54,409 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 [2024-11-14 05:41:54,540 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 [2024-11-14 05:41:54,547 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 [2024-11-14 05:41:55,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:55,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:41:55,576 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 [2024-11-14 05:41:55,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:41:55,733 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 [2024-11-14 05:41:55,742 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 [2024-11-14 05:41:55,775 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 [2024-11-14 05:41:55,783 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 [2024-11-14 05:41:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:41:55,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:55,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:41:56,009 WARN L851 $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_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-14 05:41:57,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4353 (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_4354) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4353))) (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_4354) .cse2 v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:41:57,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:41:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351955373] [2024-11-14 05:41:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351955373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [662713002] [2024-11-14 05:41:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:57,776 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:41:57,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:41:57,778 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:41:57,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-14 05:43:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:36,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-14 05:43:36,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:36,571 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 [2024-11-14 05:43:36,721 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:43:36,721 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 [2024-11-14 05:43:36,733 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 [2024-11-14 05:43:36,746 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 [2024-11-14 05:43:36,752 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 [2024-11-14 05:43:36,833 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 [2024-11-14 05:43:36,839 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 [2024-11-14 05:43:37,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:37,718 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 [2024-11-14 05:43:37,725 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 [2024-11-14 05:43:37,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:37,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:43:37,817 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 [2024-11-14 05:43:37,852 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 [2024-11-14 05:43:37,860 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 [2024-11-14 05:43:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:43:37,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:37,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (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_4806) |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_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:43:37,970 WARN L851 $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_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:43:39,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4897))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4898) .cse0 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (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_4898) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-14 05:43:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [662713002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127091910] [2024-11-14 05:43:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:39,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:39,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:39,802 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:39,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 05:43:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:40,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-14 05:43:40,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:40,726 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 [2024-11-14 05:43:40,745 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:43:40,745 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 [2024-11-14 05:43:40,761 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 [2024-11-14 05:43:40,771 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 [2024-11-14 05:43:40,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:43:40,859 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 [2024-11-14 05:43:41,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:41,739 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 [2024-11-14 05:43:41,746 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 [2024-11-14 05:43:41,847 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:41,847 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 [2024-11-14 05:43:41,856 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 [2024-11-14 05:43:41,902 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 [2024-11-14 05:43:41,912 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 [2024-11-14 05:43:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:43:41,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:42,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5349 (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_5348) |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_5349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:43:42,048 WARN L851 $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_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:43:43,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5441))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5440) .cse0 v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5441 (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_5440) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-14 05:43:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127091910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:43,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-14 05:43:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288096410] [2024-11-14 05:43:43,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:43,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:43:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:43:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:43:43,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=113, Unknown=9, NotChecked=252, Total=420 [2024-11-14 05:43:43,726 INFO L87 Difference]: Start difference. First operand 769 states and 817 transitions. Second operand has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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) [2024-11-14 05:43:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:53,533 INFO L93 Difference]: Finished difference Result 768 states and 816 transitions. [2024-11-14 05:43:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:43:53,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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 118 [2024-11-14 05:43:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:53,537 INFO L225 Difference]: With dead ends: 768 [2024-11-14 05:43:53,538 INFO L226 Difference]: Without dead ends: 768 [2024-11-14 05:43:53,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 348 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=222, Unknown=9, NotChecked=342, Total=650 [2024-11-14 05:43:53,538 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 369 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:53,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2332 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-14 05:43:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-14 05:43:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2024-11-14 05:43:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 494 states have (on average 1.6376518218623481) internal successors, (809), 762 states have internal predecessors, (809), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:43:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 816 transitions. [2024-11-14 05:43:53,556 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 816 transitions. Word has length 118 [2024-11-14 05:43:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:53,556 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 816 transitions. [2024-11-14 05:43:53,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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) [2024-11-14 05:43:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 816 transitions. [2024-11-14 05:43:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 05:43:53,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:53,558 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:53,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2024-11-14 05:43:53,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:43:53,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 05:43:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:54,159 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:43:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 194986281, now seen corresponding path program 1 times [2024-11-14 05:43:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:43:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462353666] [2024-11-14 05:43:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:54,161 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 [2024-11-14 05:43:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:43:54,163 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:43:54,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:43:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:55,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 05:43:55,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:55,347 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 [2024-11-14 05:43:55,569 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:43:55,569 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 [2024-11-14 05:43:55,605 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 [2024-11-14 05:43:55,727 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 [2024-11-14 05:43:56,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:56,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:43:57,059 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:57,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 [2024-11-14 05:43:57,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:57,174 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 [2024-11-14 05:43:57,205 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 [2024-11-14 05:43:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:43:57,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:57,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5863 (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~mem36#1.base| v_ArrVal_5863) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 05:43:57,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5863 (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_5863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2024-11-14 05:43:57,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (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_5862))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 05:43:57,371 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5862))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:43:57,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5909 (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~mem33#1.base| v_ArrVal_5909))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5862)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:43:57,876 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:43:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462353666] [2024-11-14 05:43:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462353666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1069159080] [2024-11-14 05:43:57,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:57,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:43:57,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:43:57,878 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:43:57,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-14 05:44:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:20,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 05:44:20,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:20,852 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:44:20,852 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 [2024-11-14 05:44:21,298 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:44:21,298 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 [2024-11-14 05:44:21,411 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 19 treesize of output 1 [2024-11-14 05:44:21,673 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 34 treesize of output 16 [2024-11-14 05:44:23,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:23,390 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 54 treesize of output 51 [2024-11-14 05:44:23,653 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:23,653 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 54 treesize of output 51 [2024-11-14 05:44:23,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:23,829 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 54 treesize of output 51 [2024-11-14 05:44:23,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-14 05:44:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:44:23,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:24,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6331 (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_6331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2024-11-14 05:44:24,089 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (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_6330))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-14 05:44:24,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:44:24,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (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~mem33#1.base| v_ArrVal_6377))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:44:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1069159080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958995994] [2024-11-14 05:44:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:24,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:24,608 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:24,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 05:44:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:25,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 05:44:25,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:25,484 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 [2024-11-14 05:44:25,633 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:44:25,633 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 [2024-11-14 05:44:25,685 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 [2024-11-14 05:44:26,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:26,646 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 [2024-11-14 05:44:26,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:26,844 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 [2024-11-14 05:44:26,974 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:26,974 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 [2024-11-14 05:44:26,995 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 [2024-11-14 05:44:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:44:26,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:27,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (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_6797))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-14 05:44:27,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6797))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:44:27,718 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-14 05:44:27,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2024-11-14 05:44:27,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (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_6844))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6797)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-14 05:44:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958995994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:27,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:44:27,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 30 [2024-11-14 05:44:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890831928] [2024-11-14 05:44:27,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:27,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:44:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:44:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:44:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=902, Unknown=20, NotChecked=876, Total=1980 [2024-11-14 05:44:27,737 INFO L87 Difference]: Start difference. First operand 768 states and 816 transitions. Second operand has 31 states, 27 states have (on average 6.481481481481482) internal successors, (175), 30 states have internal predecessors, (175), 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) [2024-11-14 05:44:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:44,714 INFO L93 Difference]: Finished difference Result 1415 states and 1508 transitions. [2024-11-14 05:44:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:44:44,715 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.481481481481482) internal successors, (175), 30 states have internal predecessors, (175), 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 121 [2024-11-14 05:44:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:44,718 INFO L225 Difference]: With dead ends: 1415 [2024-11-14 05:44:44,718 INFO L226 Difference]: Without dead ends: 1415 [2024-11-14 05:44:44,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 344 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=258, Invalid=1492, Unknown=20, NotChecked=1092, Total=2862 [2024-11-14 05:44:44,720 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 882 mSDsluCounter, 5697 mSDsCounter, 0 mSdLazyCounter, 6343 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 6048 SdHoareTripleChecker+Invalid, 6363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:44,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 6048 Invalid, 6363 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6343 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2024-11-14 05:44:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-14 05:44:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 767. [2024-11-14 05:44:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 494 states have (on average 1.6356275303643724) internal successors, (808), 761 states have internal predecessors, (808), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:44:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 815 transitions. [2024-11-14 05:44:44,743 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 815 transitions. Word has length 121 [2024-11-14 05:44:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:44,743 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 815 transitions. [2024-11-14 05:44:44,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.481481481481482) internal successors, (175), 30 states have internal predecessors, (175), 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) [2024-11-14 05:44:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 815 transitions. [2024-11-14 05:44:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 05:44:44,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:44,745 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:44,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:44:44,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2024-11-14 05:44:45,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-14 05:44:45,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:45,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:44:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 194986282, now seen corresponding path program 1 times [2024-11-14 05:44:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:44:45,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436535534] [2024-11-14 05:44:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:45,348 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 [2024-11-14 05:44:45,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:44:45,351 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:44:45,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:44:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:46,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 05:44:46,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:46,705 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 [2024-11-14 05:44:46,859 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:44:46,859 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 [2024-11-14 05:44:46,867 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 [2024-11-14 05:44:46,893 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 [2024-11-14 05:44:46,903 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 [2024-11-14 05:44:47,031 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 [2024-11-14 05:44:47,037 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 [2024-11-14 05:44:47,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:47,956 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 [2024-11-14 05:44:47,970 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 [2024-11-14 05:44:48,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:48,091 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 [2024-11-14 05:44:48,097 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 [2024-11-14 05:44:48,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:44:48,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 62 treesize of output 57 [2024-11-14 05:44:48,223 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 [2024-11-14 05:44:48,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:44:48,264 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 [2024-11-14 05:44:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:44:48,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:48,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:44:48,500 WARN L851 $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_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:44:48,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7311))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7310) .cse0 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (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_7310) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-14 05:44:48,625 WARN L851 $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_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7310) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7311))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7310) .cse3 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:44:50,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7405))) (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~mem33#1.base| v_ArrVal_7404) .cse1 v_ArrVal_7310) (select (select (store .cse2 .cse1 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7312))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7405))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7311))) (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~mem33#1.base| v_ArrVal_7404) .cse4 v_ArrVal_7310) .cse5 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 05:44:50,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:44:50,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436535534] [2024-11-14 05:44:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436535534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1001939783] [2024-11-14 05:44:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:44:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:44:50,482 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:44:50,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-14 05:48:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:57,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-14 05:48:57,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:57,402 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 [2024-11-14 05:48:57,562 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 [2024-11-14 05:48:57,579 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:48:57,579 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 [2024-11-14 05:48:57,591 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 [2024-11-14 05:48:57,601 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 [2024-11-14 05:48:57,677 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 [2024-11-14 05:48: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 9 treesize of output 3 [2024-11-14 05:48:58,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:48:58,487 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 [2024-11-14 05:48:58,495 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 [2024-11-14 05:48:58,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:48:58,589 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 [2024-11-14 05:48:58,595 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 [2024-11-14 05:48:58,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:48:58,664 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 [2024-11-14 05:48:58,670 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 [2024-11-14 05:48:58,703 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 [2024-11-14 05:48:58,711 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 [2024-11-14 05:48:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:48:58,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:58,776 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-14 05:48:58,805 WARN L851 $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_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:48:58,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7872))) (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_7871) .cse0 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (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_7871) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-14 05:48:58,891 WARN L851 $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_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7871) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7872))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7871) .cse3 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:49:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1001939783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494843407] [2024-11-14 05:49:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:01,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:01,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:49:01,564 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:49:01,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 05:49:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:02,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 05:49:02,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:02,410 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 [2024-11-14 05:49:02,842 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 [2024-11-14 05:49:02,877 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:49:02,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 [2024-11-14 05:49:02,896 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 [2024-11-14 05:49:02,913 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 [2024-11-14 05:49:03,082 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 [2024-11-14 05:49:03,091 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 [2024-11-14 05:49:04,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:04,848 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 [2024-11-14 05:49:04,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:49:05,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:05,053 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 [2024-11-14 05:49:05,066 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 [2024-11-14 05:49:05,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:05,205 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 [2024-11-14 05:49:05,220 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 [2024-11-14 05:49:05,305 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 [2024-11-14 05:49:05,326 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 [2024-11-14 05:49:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:49:05,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:05,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-14 05:49:05,511 WARN L851 $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_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-14 05:49:05,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (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_8432) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8433))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8432) .cse2 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:49:05,629 WARN L851 $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_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8432) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8433))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8432) .cse3 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:49:08,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8527))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8433))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8526) .cse0 v_ArrVal_8432) .cse1 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (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_8527))) (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_8526) .cse6 v_ArrVal_8432) (select (select (store .cse7 .cse6 v_ArrVal_8433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8435))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-14 05:49:08,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494843407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:08,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:49:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-14 05:49:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343466738] [2024-11-14 05:49:08,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:49:08,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:49:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:49:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:49:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=152, Unknown=23, NotChecked=518, Total=756 [2024-11-14 05:49:08,116 INFO L87 Difference]: Start difference. First operand 767 states and 815 transitions. Second operand has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 states have internal predecessors, (77), 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) [2024-11-14 05:49:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:28,521 INFO L93 Difference]: Finished difference Result 766 states and 814 transitions. [2024-11-14 05:49:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:49:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 states have internal predecessors, (77), 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 121 [2024-11-14 05:49:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:28,525 INFO L225 Difference]: With dead ends: 766 [2024-11-14 05:49:28,525 INFO L226 Difference]: Without dead ends: 766 [2024-11-14 05:49:28,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 359 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=102, Invalid=308, Unknown=26, NotChecked=686, Total=1122 [2024-11-14 05:49:28,528 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 367 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 3650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:28,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2576 Invalid, 3650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2024-11-14 05:49:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-14 05:49:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2024-11-14 05:49:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 494 states have (on average 1.6336032388663968) internal successors, (807), 760 states have internal predecessors, (807), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:49:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 814 transitions. [2024-11-14 05:49:28,541 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 814 transitions. Word has length 121 [2024-11-14 05:49:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:28,541 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 814 transitions. [2024-11-14 05:49:28,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 states have internal predecessors, (77), 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) [2024-11-14 05:49:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 814 transitions. [2024-11-14 05:49:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 05:49:28,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:28,543 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:28,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2024-11-14 05:49:28,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-14 05:49:28,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:49:29,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:29,144 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:49:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2040803070, now seen corresponding path program 1 times [2024-11-14 05:49:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:49:29,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195220722] [2024-11-14 05:49:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:29,145 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 [2024-11-14 05:49:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:49:29,147 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:49:29,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:49:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:30,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 05:49:30,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:30,378 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 [2024-11-14 05:49:30,875 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:49:30,875 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 [2024-11-14 05:49:30,957 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 [2024-11-14 05:49:31,198 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 [2024-11-14 05:49:33,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:33,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 43 [2024-11-14 05:49:34,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:34,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:49:34,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:34,263 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 [2024-11-14 05:49:34,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:34,502 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 [2024-11-14 05:49:34,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 [2024-11-14 05:49:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:49:34,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:34,946 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:49:34,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (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_8964))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:49:35,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:49:35,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (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_8963))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:49:35,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (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_8963))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:49:35,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9011))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8963)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:49:35,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:49:35,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195220722] [2024-11-14 05:49:35,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195220722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:35,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [729000429] [2024-11-14 05:49:35,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:35,869 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:49:35,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:49:35,871 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:49:35,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-14 05:50:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:38,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-14 05:50:38,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:38,187 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:50:38,187 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 [2024-11-14 05:50:39,240 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:50:39,241 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 [2024-11-14 05:50:39,418 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 19 treesize of output 1 [2024-11-14 05:50:39,977 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 34 treesize of output 16 [2024-11-14 05:50:43,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:43,447 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 54 treesize of output 51 [2024-11-14 05:50:43,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:43,950 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 54 treesize of output 51 [2024-11-14 05:50:44,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:44,316 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 54 treesize of output 51 [2024-11-14 05:50:44,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:44,712 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 54 treesize of output 51 [2024-11-14 05:50:44,839 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 43 treesize of output 19 [2024-11-14 05:50:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:50:45,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:50:45,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (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_9448))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:50:45,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:50:45,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (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_9447))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:50:45,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (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_9447))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:50:46,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9495))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9447)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:50:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [729000429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:50:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637116540] [2024-11-14 05:50:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:50:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:50:46,151 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:50:46,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 05:50:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:47,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 05:50:47,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:47,462 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:50:47,463 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 [2024-11-14 05:50:47,601 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 [2024-11-14 05:50:48,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:48,776 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 [2024-11-14 05:50:49,007 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:49,007 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 [2024-11-14 05:50:49,235 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:49,236 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 [2024-11-14 05:50:49,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:49,535 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 [2024-11-14 05:50:49,736 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 [2024-11-14 05:50:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:50:49,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:50:49,820 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 05:50:49,820 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 [2024-11-14 05:50:50,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9931 (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_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-14 05:50:50,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9930)) (.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_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-14 05:50:50,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 05:50:50,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9929))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 05:50:50,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9929))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 05:50:51,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9977))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9929)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 05:50:51,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637116540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:50:51,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:50:51,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2024-11-14 05:50:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697878387] [2024-11-14 05:50:51,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:50:51,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:50:51,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:50:51,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:50:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1070, Unknown=42, NotChecked=1428, Total=2756 [2024-11-14 05:50:51,057 INFO L87 Difference]: Start difference. First operand 766 states and 814 transitions. Second operand has 33 states, 29 states have (on average 6.448275862068965) internal successors, (187), 33 states have internal predecessors, (187), 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) [2024-11-14 05:51:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:19,225 INFO L93 Difference]: Finished difference Result 1411 states and 1504 transitions. [2024-11-14 05:51:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:51:19,226 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 6.448275862068965) internal successors, (187), 33 states have internal predecessors, (187), 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 124 [2024-11-14 05:51:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:19,230 INFO L225 Difference]: With dead ends: 1411 [2024-11-14 05:51:19,230 INFO L226 Difference]: Without dead ends: 1411 [2024-11-14 05:51:19,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=252, Invalid=1334, Unknown=42, NotChecked=1564, Total=3192 [2024-11-14 05:51:19,231 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1462 mSDsluCounter, 5147 mSDsCounter, 0 mSdLazyCounter, 5673 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 5498 SdHoareTripleChecker+Invalid, 5701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:19,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 5498 Invalid, 5701 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5673 Invalid, 0 Unknown, 0 Unchecked, 27.5s Time] [2024-11-14 05:51:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-14 05:51:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 765. [2024-11-14 05:51:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 494 states have (on average 1.631578947368421) internal successors, (806), 759 states have internal predecessors, (806), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:51:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 813 transitions. [2024-11-14 05:51:19,246 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 813 transitions. Word has length 124 [2024-11-14 05:51:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:19,247 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 813 transitions. [2024-11-14 05:51:19,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 6.448275862068965) internal successors, (187), 33 states have internal predecessors, (187), 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) [2024-11-14 05:51:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 813 transitions. [2024-11-14 05:51:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 05:51:19,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:19,248 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:19,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2024-11-14 05:51:19,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 05:51:19,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:51:19,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:19,849 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:51:19,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2040803071, now seen corresponding path program 1 times [2024-11-14 05:51:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301950744] [2024-11-14 05:51:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:19,851 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 [2024-11-14 05:51:19,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:19,852 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 05:51:19,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:51:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:21,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 05:51:21,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:21,105 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 [2024-11-14 05:51:21,946 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:51:21,946 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 [2024-11-14 05:51:21,971 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 [2024-11-14 05:51:22,035 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 [2024-11-14 05:51:22,044 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 [2024-11-14 05:51:22,356 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 [2024-11-14 05:51:22,366 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 [2024-11-14 05:51:24,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:51:24,118 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 [2024-11-14 05:51:24,127 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 [2024-11-14 05:51:24,407 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:51:24,407 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 [2024-11-14 05:51:24,418 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 [2024-11-14 05:51:24,672 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:51:24,673 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 [2024-11-14 05:51:24,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 05:51:24,960 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:51:24,960 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 [2024-11-14 05:51:24,971 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 [2024-11-14 05:51:25,057 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 [2024-11-14 05:51:25,067 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 [2024-11-14 05:51:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:51:25,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:25,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:51:25,500 WARN L851 $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_10462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:51:25,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10460) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10461))) (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~mem36#1.base| v_ArrVal_10460) .cse2 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:51:25,689 WARN L851 $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_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10460) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10461))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10460) .cse3 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:51:25,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (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_10458))) (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_10459) .cse1 v_ArrVal_10460) (select (select (store .cse2 .cse1 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10462))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10458))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10461))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10459) .cse4 v_ArrVal_10460) .cse5 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 05:51:25,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10458))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10461))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10459) .cse1 v_ArrVal_10460) .cse2 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10458))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10459) .cse7 v_ArrVal_10460) (select (select (store .cse8 .cse7 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10462))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-14 05:51:28,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10555 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10554))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10458))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10461))) (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_10555) .cse0 v_ArrVal_10459) .cse1 v_ArrVal_10460) .cse2 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10555 (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_10554))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10458))) (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_10555) .cse8 v_ArrVal_10459) .cse9 v_ArrVal_10460) (select (select (store .cse10 .cse9 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10462))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-14 05:51:28,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301950744] [2024-11-14 05:51:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301950744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2002299623] [2024-11-14 05:51:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:51:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:51:28,365 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:51:28,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0cc0564-fec7-4fbb-a109-35c447dc6755/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process