./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje --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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:38:43,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:38:43,124 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:38:43,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:38:43,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:38:43,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:38:43,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:38:43,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:38:43,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:38:43,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:38:43,176 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:38:43,176 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:38:43,177 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:38:43,177 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:38:43,178 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:38:43,178 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:38:43,179 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:38:43,179 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:38:43,180 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:38:43,180 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:38:43,181 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:38:43,181 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:38:43,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:38:43,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:38:43,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:38:43,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:38:43,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:38:43,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:38:43,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:38:43,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:38:43,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:38:43,213 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:38:43,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:38:43,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:38:43,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:38:43,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:38:43,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:38:43,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:38:43,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:38:43,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:38:43,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:38:43,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:38:43,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:38:43,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:38:43,219 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:38:43,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:38:43,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:38:43,220 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:38:43,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:38:43,221 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-09 06:38:43,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:38:43,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:38:43,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:38:43,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:38:43,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:38:43,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i Unable to find full path for "g++" [2024-11-09 06:38:45,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:38:46,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:38:46,172 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-09 06:38:46,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data/be022ec6e/9ee77f3569ac482f829a649c693dd342/FLAGd08d40f74 [2024-11-09 06:38:46,225 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data/be022ec6e/9ee77f3569ac482f829a649c693dd342 [2024-11-09 06:38:46,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:38:46,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:38:46,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:38:46,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:38:46,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:38:46,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:46" (1/1) ... [2024-11-09 06:38:46,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a28966a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:46, skipping insertion in model container [2024-11-09 06:38:46,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:46" (1/1) ... [2024-11-09 06:38:46,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:38:47,212 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-09 06:38:47,238 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-09 06:38:47,243 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-09 06:38:47,248 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-09 06:38:47,262 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-09 06:38:47,294 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-09 06:38:47,294 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-09 06:38:47,298 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-09 06:38:47,298 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-09 06:38:47,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-09 06:38:47,304 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-09 06:38:47,306 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-09 06:38:47,307 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-09 06:38:47,312 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-09 06:38:47,317 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-09 06:38:47,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:38:47,336 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-09 06:38:47,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f339687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:47, skipping insertion in model container [2024-11-09 06:38:47,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:38:47,338 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 06:38:47,342 INFO L158 Benchmark]: Toolchain (without parser) took 1108.36ms. Allocated memory is still 136.3MB. Free memory was 94.6MB in the beginning and 57.3MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 06:38:47,343 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 136.3MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:38:47,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1103.41ms. Allocated memory is still 136.3MB. Free memory was 94.6MB in the beginning and 57.3MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 06:38:47,346 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.32ms. Allocated memory is still 136.3MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1103.41ms. Allocated memory is still 136.3MB. Free memory was 94.6MB in the beginning and 57.3MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje --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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:38:49,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:38:49,801 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 06:38:49,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:38:49,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:38:49,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:38:49,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:38:49,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:38:49,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:38:49,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:38:49,834 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:38:49,835 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:38:49,835 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:38:49,835 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:38:49,836 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:38:49,836 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:38:49,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:38:49,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:38:49,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:38:49,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:38:49,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:38:49,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:38:49,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:38:49,844 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:38:49,844 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:38:49,845 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:38:49,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:38:49,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:38:49,845 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:38:49,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:38:49,846 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:38:49,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:38:49,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:38:49,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:38:49,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:38:49,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:38:49,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:38:49,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:38:49,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:38:49,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:38:49,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:38:49,850 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:38:49,850 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:38:49,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:38:49,851 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:38:49,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-09 06:38:50,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:38:50,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:38:50,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:38:50,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:38:50,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:38:50,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i Unable to find full path for "g++" [2024-11-09 06:38:52,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:38:52,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:38:52,801 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-09 06:38:52,823 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data/57ddc5b47/a076bd9afd7248228c2eaa7eb20536c4/FLAG7a51bd100 [2024-11-09 06:38:52,841 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/data/57ddc5b47/a076bd9afd7248228c2eaa7eb20536c4 [2024-11-09 06:38:52,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:38:52,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:38:52,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:38:52,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:38:52,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:38:52,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:52" (1/1) ... [2024-11-09 06:38:52,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a18e211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:52, skipping insertion in model container [2024-11-09 06:38:52,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:52" (1/1) ... [2024-11-09 06:38:52,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:38:53,743 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-09 06:38:53,786 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-09 06:38:53,793 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-09 06:38:53,802 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-09 06:38:53,813 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-09 06:38:53,859 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-09 06:38:53,862 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-09 06:38:53,865 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-09 06:38:53,885 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-09 06:38:53,889 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-09 06:38:53,892 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-09 06:38:53,894 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-09 06:38:53,898 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-09 06:38:53,899 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-09 06:38:53,903 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-09 06:38:53,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:38:53,936 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 06:38:53,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:38:54,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-09 06:38:54,094 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-09 06:38:54,096 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-09 06:38:54,101 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-09 06:38:54,106 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-09 06:38:54,138 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-09 06:38:54,139 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-09 06:38:54,142 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-09 06:38:54,142 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-09 06:38:54,147 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-09 06:38:54,148 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-09 06:38:54,151 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-09 06:38:54,152 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-09 06:38:54,153 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-09 06:38:54,157 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-09 06:38:54,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:38:54,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:38:54,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:38:54,346 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:38:54,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54 WrapperNode [2024-11-09 06:38:54,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:38:54,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:38:54,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:38:54,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:38:54,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,554 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3027 [2024-11-09 06:38:54,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:38:54,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:38:54,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:38:54,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:38:54,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:38:54,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:38:54,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:38:54,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:38:54,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (1/1) ... [2024-11-09 06:38:54,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:38:54,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:38:54,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:38:54,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:38:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:38:54,824 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:38:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 06:38:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 06:38:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:38:54,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:38:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 06:38:54,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 06:38:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:38:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:38:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:38:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:38:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:38:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:38:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 06:38:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:38:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:38:54,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:38:55,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:38:55,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:38:55,203 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 06:39:02,307 INFO L? ?]: Removed 1593 outVars from TransFormulas that were not future-live. [2024-11-09 06:39:02,307 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:39:02,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:39:02,377 INFO L316 CfgBuilder]: Removed 58 assume(true) statements. [2024-11-09 06:39:02,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:39:02 BoogieIcfgContainer [2024-11-09 06:39:02,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:39:02,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:39:02,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:39:02,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:39:02,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:38:52" (1/3) ... [2024-11-09 06:39:02,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab5bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:39:02, skipping insertion in model container [2024-11-09 06:39:02,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:54" (2/3) ... [2024-11-09 06:39:02,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab5bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:39:02, skipping insertion in model container [2024-11-09 06:39:02,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:39:02" (3/3) ... [2024-11-09 06:39:02,390 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2024-11-09 06:39:02,409 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:39:02,410 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-09 06:39:02,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:39:02,505 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;@108c372e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:39:02,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-09 06:39:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 2077 states, 1042 states have (on average 2.105566218809981) internal successors, (2194), 2070 states have internal predecessors, (2194), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-09 06:39:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:39:02,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:02,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:39:02,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:02,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash 47731, now seen corresponding path program 1 times [2024-11-09 06:39:02,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306669853] [2024-11-09 06:39:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:02,555 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-09 06:39:02,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:02,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:02,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:02,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:39:02,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:02,802 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-09 06:39:02,819 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-09 06:39:02,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:02,820 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306669853] [2024-11-09 06:39:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306669853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:02,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:02,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:39:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597714610] [2024-11-09 06:39:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:02,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:39:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:02,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:39:02,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:02,872 INFO L87 Difference]: Start difference. First operand has 2077 states, 1042 states have (on average 2.105566218809981) internal successors, (2194), 2070 states have internal predecessors, (2194), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:06,480 INFO L93 Difference]: Finished difference Result 2243 states and 3316 transitions. [2024-11-09 06:39:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:39:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 06:39:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:06,516 INFO L225 Difference]: With dead ends: 2243 [2024-11-09 06:39:06,516 INFO L226 Difference]: Without dead ends: 2241 [2024-11-09 06:39:06,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:06,521 INFO L432 NwaCegarLoop]: 2649 mSDtfsCounter, 1983 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2486 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:06,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2486 Valid, 2806 Invalid, 1156 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:39:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2024-11-09 06:39:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2061. [2024-11-09 06:39:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 1044 states have (on average 2.0268199233716473) internal successors, (2116), 2054 states have internal predecessors, (2116), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 06:39:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3124 transitions. [2024-11-09 06:39:06,965 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3124 transitions. Word has length 3 [2024-11-09 06:39:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:06,966 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3124 transitions. [2024-11-09 06:39:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3124 transitions. [2024-11-09 06:39:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:39:06,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:06,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:39:06,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:07,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash 47732, now seen corresponding path program 1 times [2024-11-09 06:39:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493039446] [2024-11-09 06:39:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:07,170 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-09 06:39:07,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:07,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:07,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:07,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:39:07,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:07,292 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-09 06:39:07,310 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-09 06:39:07,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:07,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493039446] [2024-11-09 06:39:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493039446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:39:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424106372] [2024-11-09 06:39:07,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:07,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:39:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:39:07,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:07,315 INFO L87 Difference]: Start difference. First operand 2061 states and 3124 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:12,042 INFO L93 Difference]: Finished difference Result 3480 states and 5579 transitions. [2024-11-09 06:39:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:39:12,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 06:39:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:12,064 INFO L225 Difference]: With dead ends: 3480 [2024-11-09 06:39:12,065 INFO L226 Difference]: Without dead ends: 3480 [2024-11-09 06:39:12,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:12,067 INFO L432 NwaCegarLoop]: 3025 mSDtfsCounter, 1454 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:12,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 5121 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 06:39:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2024-11-09 06:39:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3191. [2024-11-09 06:39:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 1675 states have (on average 2.0035820895522387) internal successors, (3356), 3184 states have internal predecessors, (3356), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 5364 transitions. [2024-11-09 06:39:12,448 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 5364 transitions. Word has length 3 [2024-11-09 06:39:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 5364 transitions. [2024-11-09 06:39:12,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 5364 transitions. [2024-11-09 06:39:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:39:12,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:12,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:39:12,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 06:39:12,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:12,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1130822653, now seen corresponding path program 1 times [2024-11-09 06:39:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163346535] [2024-11-09 06:39:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:12,660 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-09 06:39:12,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:12,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:12,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:12,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:39:12,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:12,861 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-09 06:39:12,874 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-09 06:39:12,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:39:12,985 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-09 06:39:13,012 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:39:13,013 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-09 06:39:13,051 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-09 06:39:13,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:13,051 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163346535] [2024-11-09 06:39:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163346535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:39:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964493537] [2024-11-09 06:39:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:13,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:13,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:13,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:13,055 INFO L87 Difference]: Start difference. First operand 3191 states and 5364 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:19,327 INFO L93 Difference]: Finished difference Result 3360 states and 5542 transitions. [2024-11-09 06:39:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:39:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:39:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:19,344 INFO L225 Difference]: With dead ends: 3360 [2024-11-09 06:39:19,344 INFO L226 Difference]: Without dead ends: 3360 [2024-11-09 06:39:19,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:19,345 INFO L432 NwaCegarLoop]: 2380 mSDtfsCounter, 4242 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4745 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:19,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4745 Valid, 2470 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 06:39:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2024-11-09 06:39:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2049. [2024-11-09 06:39:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2049 states, 1044 states have (on average 2.014367816091954) internal successors, (2103), 2042 states have internal predecessors, (2103), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 06:39:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3111 transitions. [2024-11-09 06:39:19,642 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3111 transitions. Word has length 7 [2024-11-09 06:39:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:19,642 INFO L471 AbstractCegarLoop]: Abstraction has 2049 states and 3111 transitions. [2024-11-09 06:39:19,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3111 transitions. [2024-11-09 06:39:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:39:19,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:19,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:39:19,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:39:19,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:19,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:19,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 695763858, now seen corresponding path program 1 times [2024-11-09 06:39:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617310355] [2024-11-09 06:39:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:19,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:39:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:19,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:19,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:19,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:39:19,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:20,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:39:20,025 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-09 06:39:20,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:20,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617310355] [2024-11-09 06:39:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617310355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:20,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:39:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378230926] [2024-11-09 06:39:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:39:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:39:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:20,028 INFO L87 Difference]: Start difference. First operand 2049 states and 3111 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:23,678 INFO L93 Difference]: Finished difference Result 3221 states and 5307 transitions. [2024-11-09 06:39:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:39:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 06:39:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:23,692 INFO L225 Difference]: With dead ends: 3221 [2024-11-09 06:39:23,692 INFO L226 Difference]: Without dead ends: 3221 [2024-11-09 06:39:23,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:23,693 INFO L432 NwaCegarLoop]: 4788 mSDtfsCounter, 1762 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 7051 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:23,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 7051 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 06:39:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2024-11-09 06:39:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 2002. [2024-11-09 06:39:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1044 states have (on average 1.9693486590038314) internal successors, (2056), 1995 states have internal predecessors, (2056), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 06:39:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 3064 transitions. [2024-11-09 06:39:24,044 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 3064 transitions. Word has length 8 [2024-11-09 06:39:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:24,045 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 3064 transitions. [2024-11-09 06:39:24,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 3064 transitions. [2024-11-09 06:39:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:39:24,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:24,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:39:24,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:24,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:24,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 695763859, now seen corresponding path program 1 times [2024-11-09 06:39:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:24,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959972594] [2024-11-09 06:39:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:24,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-09 06:39:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:24,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:24,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:24,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:39:24,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:24,391 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-09 06:39:24,425 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-09 06:39:24,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:24,425 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959972594] [2024-11-09 06:39:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959972594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:39:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319311097] [2024-11-09 06:39:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:24,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:39:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:39:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:24,427 INFO L87 Difference]: Start difference. First operand 2002 states and 3064 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:28,465 INFO L93 Difference]: Finished difference Result 3297 states and 5386 transitions. [2024-11-09 06:39:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:39:28,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 06:39:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:28,475 INFO L225 Difference]: With dead ends: 3297 [2024-11-09 06:39:28,475 INFO L226 Difference]: Without dead ends: 3297 [2024-11-09 06:39:28,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:28,477 INFO L432 NwaCegarLoop]: 4965 mSDtfsCounter, 1511 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7399 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:28,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7399 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 06:39:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2024-11-09 06:39:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2029. [2024-11-09 06:39:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 1081 states have (on average 1.9611470860314524) internal successors, (2120), 2022 states have internal predecessors, (2120), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 06:39:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3128 transitions. [2024-11-09 06:39:28,807 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3128 transitions. Word has length 8 [2024-11-09 06:39:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:28,807 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3128 transitions. [2024-11-09 06:39:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3128 transitions. [2024-11-09 06:39:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:39:28,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:28,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:39:28,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 06:39:29,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:29,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1515150878, now seen corresponding path program 1 times [2024-11-09 06:39:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936814514] [2024-11-09 06:39:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:29,015 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-09 06:39:29,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:29,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:29,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:29,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:39:29,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:29,233 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-09 06:39:29,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:29,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936814514] [2024-11-09 06:39:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936814514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:29,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:39:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903107435] [2024-11-09 06:39:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:29,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:39:29,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:39:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:29,237 INFO L87 Difference]: Start difference. First operand 2029 states and 3128 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:29,628 INFO L93 Difference]: Finished difference Result 3476 states and 5634 transitions. [2024-11-09 06:39:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:39:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:39:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:29,643 INFO L225 Difference]: With dead ends: 3476 [2024-11-09 06:39:29,643 INFO L226 Difference]: Without dead ends: 3476 [2024-11-09 06:39:29,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:29,644 INFO L432 NwaCegarLoop]: 3114 mSDtfsCounter, 1476 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 6076 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:29,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 6076 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:39:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2024-11-09 06:39:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3208. [2024-11-09 06:39:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 1760 states have (on average 1.9454545454545455) internal successors, (3424), 3201 states have internal predecessors, (3424), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 5432 transitions. [2024-11-09 06:39:30,005 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 5432 transitions. Word has length 11 [2024-11-09 06:39:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:30,006 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 5432 transitions. [2024-11-09 06:39:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 5432 transitions. [2024-11-09 06:39:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 06:39:30,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:30,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:39:30,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:30,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:30,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:30,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2038156439, now seen corresponding path program 1 times [2024-11-09 06:39:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:30,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080179901] [2024-11-09 06:39:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:30,211 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-09 06:39:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:30,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:30,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:30,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:39:30,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:30,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:39:30,416 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:39:30,420 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 33 treesize of output 31 [2024-11-09 06:39:30,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:39:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-09 06:39:30,493 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-09 06:39:30,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:30,494 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:30,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080179901] [2024-11-09 06:39:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080179901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:30,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:39:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275988762] [2024-11-09 06:39:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:30,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:30,497 INFO L87 Difference]: Start difference. First operand 3208 states and 5432 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:33,925 INFO L93 Difference]: Finished difference Result 5578 states and 9838 transitions. [2024-11-09 06:39:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:39:33,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 06:39:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:33,951 INFO L225 Difference]: With dead ends: 5578 [2024-11-09 06:39:33,952 INFO L226 Difference]: Without dead ends: 5578 [2024-11-09 06:39:33,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-09 06:39:33,952 INFO L432 NwaCegarLoop]: 3126 mSDtfsCounter, 1389 mSDsluCounter, 5514 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 8640 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:33,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 8640 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:39:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2024-11-09 06:39:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 3207. [2024-11-09 06:39:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 1759 states have (on average 1.945423536100057) internal successors, (3422), 3200 states have internal predecessors, (3422), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 5430 transitions. [2024-11-09 06:39:34,627 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 5430 transitions. Word has length 14 [2024-11-09 06:39:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:34,627 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 5430 transitions. [2024-11-09 06:39:34,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 5430 transitions. [2024-11-09 06:39:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:39:34,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:34,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:39:34,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:34,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:34,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -927421553, now seen corresponding path program 1 times [2024-11-09 06:39:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960828110] [2024-11-09 06:39:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:34,830 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-09 06:39:34,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:34,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:34,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:35,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:39:35,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:35,022 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-09 06:39:35,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:35,023 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960828110] [2024-11-09 06:39:35,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960828110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:35,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:35,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:39:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171465588] [2024-11-09 06:39:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:35,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:39:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:39:35,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:39:35,024 INFO L87 Difference]: Start difference. First operand 3207 states and 5430 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-09 06:39:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:35,089 INFO L93 Difference]: Finished difference Result 3145 states and 5340 transitions. [2024-11-09 06:39:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:39:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-09 06:39:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:35,110 INFO L225 Difference]: With dead ends: 3145 [2024-11-09 06:39:35,110 INFO L226 Difference]: Without dead ends: 3145 [2024-11-09 06:39:35,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-09 06:39:35,112 INFO L432 NwaCegarLoop]: 2989 mSDtfsCounter, 71 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5915 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-09 06:39:35,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5915 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:39:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2024-11-09 06:39:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3145. [2024-11-09 06:39:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3145 states, 1721 states have (on average 1.9360836722835562) internal successors, (3332), 3138 states have internal predecessors, (3332), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 5340 transitions. [2024-11-09 06:39:35,480 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 5340 transitions. Word has length 19 [2024-11-09 06:39:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:35,481 INFO L471 AbstractCegarLoop]: Abstraction has 3145 states and 5340 transitions. [2024-11-09 06:39:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-09 06:39:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 5340 transitions. [2024-11-09 06:39:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:39:35,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:35,483 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] [2024-11-09 06:39:35,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 06:39:35,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:35,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:35,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1316485504, now seen corresponding path program 1 times [2024-11-09 06:39:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86763941] [2024-11-09 06:39:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:35,686 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-09 06:39:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:35,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:35,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:35,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:39:35,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:35,923 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-09 06:39:35,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:35,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86763941] [2024-11-09 06:39:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86763941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:35,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:39:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056563132] [2024-11-09 06:39:35,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:35,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:35,928 INFO L87 Difference]: Start difference. First operand 3145 states and 5340 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:36,069 INFO L93 Difference]: Finished difference Result 3115 states and 5282 transitions. [2024-11-09 06:39:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:39:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 06:39:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:36,085 INFO L225 Difference]: With dead ends: 3115 [2024-11-09 06:39:36,088 INFO L226 Difference]: Without dead ends: 3115 [2024-11-09 06:39:36,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-09 06:39:36,089 INFO L432 NwaCegarLoop]: 2944 mSDtfsCounter, 48 mSDsluCounter, 5862 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8806 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-09 06:39:36,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8806 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:39:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2024-11-09 06:39:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3115. [2024-11-09 06:39:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3115 states, 1705 states have (on average 1.9202346041055718) internal successors, (3274), 3108 states have internal predecessors, (3274), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 5282 transitions. [2024-11-09 06:39:36,412 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 5282 transitions. Word has length 20 [2024-11-09 06:39:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:36,412 INFO L471 AbstractCegarLoop]: Abstraction has 3115 states and 5282 transitions. [2024-11-09 06:39:36,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 5282 transitions. [2024-11-09 06:39:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:39:36,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:36,413 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] [2024-11-09 06:39:36,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:36,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:36,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:36,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1802854638, now seen corresponding path program 1 times [2024-11-09 06:39:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104106733] [2024-11-09 06:39:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:36,615 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-09 06:39:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:36,619 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:36,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:36,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:39:36,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:36,823 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-09 06:39:36,934 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-09 06:39:36,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:36,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104106733] [2024-11-09 06:39:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104106733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:36,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:39:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277768957] [2024-11-09 06:39:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:36,938 INFO L87 Difference]: Start difference. First operand 3115 states and 5282 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-09 06:39:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:42,757 INFO L93 Difference]: Finished difference Result 3119 states and 5282 transitions. [2024-11-09 06:39:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:39:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-09 06:39:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:42,769 INFO L225 Difference]: With dead ends: 3119 [2024-11-09 06:39:42,769 INFO L226 Difference]: Without dead ends: 3119 [2024-11-09 06:39:42,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-09 06:39:42,770 INFO L432 NwaCegarLoop]: 2606 mSDtfsCounter, 1693 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 4176 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:42,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 4176 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-09 06:39:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2024-11-09 06:39:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3111. [2024-11-09 06:39:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 1705 states have (on average 1.9155425219941349) internal successors, (3266), 3104 states have internal predecessors, (3266), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 5274 transitions. [2024-11-09 06:39:43,113 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 5274 transitions. Word has length 34 [2024-11-09 06:39:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 3111 states and 5274 transitions. [2024-11-09 06:39:43,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-09 06:39:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 5274 transitions. [2024-11-09 06:39:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:39:43,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:43,116 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] [2024-11-09 06:39:43,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:43,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:43,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1802854639, now seen corresponding path program 1 times [2024-11-09 06:39:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999315049] [2024-11-09 06:39:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:43,319 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-09 06:39:43,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:43,320 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:43,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:43,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:39:43,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:43,516 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-09 06:39:43,782 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-09 06:39:43,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:43,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999315049] [2024-11-09 06:39:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999315049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:39:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542138072] [2024-11-09 06:39:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:43,785 INFO L87 Difference]: Start difference. First operand 3111 states and 5274 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-09 06:39:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:50,809 INFO L93 Difference]: Finished difference Result 5473 states and 9687 transitions. [2024-11-09 06:39:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:39:50,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-09 06:39:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:50,829 INFO L225 Difference]: With dead ends: 5473 [2024-11-09 06:39:50,829 INFO L226 Difference]: Without dead ends: 5473 [2024-11-09 06:39:50,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-09 06:39:50,830 INFO L432 NwaCegarLoop]: 5010 mSDtfsCounter, 1438 mSDsluCounter, 6000 mSDsCounter, 0 mSdLazyCounter, 2691 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 11010 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:50,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 11010 Invalid, 2694 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 2691 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-09 06:39:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2024-11-09 06:39:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3107. [2024-11-09 06:39:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 1705 states have (on average 1.910850439882698) internal successors, (3258), 3100 states have internal predecessors, (3258), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 5266 transitions. [2024-11-09 06:39:51,466 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 5266 transitions. Word has length 34 [2024-11-09 06:39:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:51,468 INFO L471 AbstractCegarLoop]: Abstraction has 3107 states and 5266 transitions. [2024-11-09 06:39:51,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-09 06:39:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 5266 transitions. [2024-11-09 06:39:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:39:51,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:51,470 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] [2024-11-09 06:39:51,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 06:39:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:51,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1430728313, now seen corresponding path program 1 times [2024-11-09 06:39:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956217101] [2024-11-09 06:39:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:51,673 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-09 06:39:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:51,676 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:51,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:51,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:39:51,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:51,986 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-09 06:39:51,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:51,987 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:51,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956217101] [2024-11-09 06:39:51,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956217101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:51,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:51,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:39:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205268134] [2024-11-09 06:39:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:51,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:51,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:51,989 INFO L87 Difference]: Start difference. First operand 3107 states and 5266 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:52,114 INFO L93 Difference]: Finished difference Result 3095 states and 5246 transitions. [2024-11-09 06:39:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:39:52,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 06:39:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:52,124 INFO L225 Difference]: With dead ends: 3095 [2024-11-09 06:39:52,125 INFO L226 Difference]: Without dead ends: 3095 [2024-11-09 06:39:52,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-09 06:39:52,126 INFO L432 NwaCegarLoop]: 2938 mSDtfsCounter, 21 mSDsluCounter, 5845 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8783 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-09 06:39:52,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8783 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:39:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2024-11-09 06:39:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3095. [2024-11-09 06:39:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 1693 states have (on average 1.9125812167749556) internal successors, (3238), 3088 states have internal predecessors, (3238), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 5246 transitions. [2024-11-09 06:39:52,488 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 5246 transitions. Word has length 53 [2024-11-09 06:39:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:52,488 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 5246 transitions. [2024-11-09 06:39:52,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:39:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 5246 transitions. [2024-11-09 06:39:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:39:52,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:52,491 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] [2024-11-09 06:39:52,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 06:39:52,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:52,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1584737093, now seen corresponding path program 1 times [2024-11-09 06:39:52,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:52,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631925266] [2024-11-09 06:39:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:52,694 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-09 06:39:52,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:52,695 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:52,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:53,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:39:53,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:53,065 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-09 06:39:53,071 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-09 06:39:53,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:39:53,866 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-09 06:39:53,887 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:39:53,888 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-09 06:39:53,908 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-09 06:39:53,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:53,908 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:53,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631925266] [2024-11-09 06:39:53,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631925266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:39:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132973811] [2024-11-09 06:39:53,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:53,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:39:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:39:53,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:39:53,911 INFO L87 Difference]: Start difference. First operand 3095 states and 5246 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-09 06:39:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:39:58,327 INFO L93 Difference]: Finished difference Result 3057 states and 5208 transitions. [2024-11-09 06:39:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:39:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-09 06:39:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:39:58,338 INFO L225 Difference]: With dead ends: 3057 [2024-11-09 06:39:58,338 INFO L226 Difference]: Without dead ends: 3057 [2024-11-09 06:39:58,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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-09 06:39:58,339 INFO L432 NwaCegarLoop]: 2473 mSDtfsCounter, 3238 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3741 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:39:58,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3741 Valid, 2591 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 06:39:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-11-09 06:39:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3020. [2024-11-09 06:39:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 1656 states have (on average 1.8876811594202898) internal successors, (3126), 3013 states have internal predecessors, (3126), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:39:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 5134 transitions. [2024-11-09 06:39:58,687 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 5134 transitions. Word has length 61 [2024-11-09 06:39:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:39:58,687 INFO L471 AbstractCegarLoop]: Abstraction has 3020 states and 5134 transitions. [2024-11-09 06:39:58,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-09 06:39:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 5134 transitions. [2024-11-09 06:39:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:39:58,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:39:58,692 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] [2024-11-09 06:39:58,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:58,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:39:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:39:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash -717148443, now seen corresponding path program 1 times [2024-11-09 06:39:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:39:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974646348] [2024-11-09 06:39:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:39:58,895 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-09 06:39:58,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:39:58,897 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:58,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:39:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:39:59,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:39:59,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:39:59,248 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-09 06:39:59,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:39:59,304 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-09 06:39:59,319 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-09 06:39:59,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:39:59,319 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:39:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974646348] [2024-11-09 06:39:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974646348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:39:59,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:39:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:39:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011969005] [2024-11-09 06:39:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:39:59,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:39:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:39:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:39:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:39:59,322 INFO L87 Difference]: Start difference. First operand 3020 states and 5134 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 06:40:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:02,171 INFO L93 Difference]: Finished difference Result 3019 states and 5133 transitions. [2024-11-09 06:40:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:40:02,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-09 06:40:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:02,182 INFO L225 Difference]: With dead ends: 3019 [2024-11-09 06:40:02,183 INFO L226 Difference]: Without dead ends: 3019 [2024-11-09 06:40:02,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-09 06:40:02,184 INFO L432 NwaCegarLoop]: 2911 mSDtfsCounter, 2 mSDsluCounter, 7449 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10360 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:02,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10360 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:40:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2024-11-09 06:40:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3019. [2024-11-09 06:40:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 1656 states have (on average 1.8870772946859904) internal successors, (3125), 3012 states have internal predecessors, (3125), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:40:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 5133 transitions. [2024-11-09 06:40:02,495 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 5133 transitions. Word has length 66 [2024-11-09 06:40:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:02,496 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 5133 transitions. [2024-11-09 06:40:02,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 06:40:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 5133 transitions. [2024-11-09 06:40:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:40:02,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:02,499 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] [2024-11-09 06:40:02,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:02,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:40:02,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -717148442, now seen corresponding path program 1 times [2024-11-09 06:40:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:40:02,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112020422] [2024-11-09 06:40:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:02,704 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-09 06:40:02,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:40:02,712 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:02,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:03,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:40:03,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:03,049 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-09 06:40:03,074 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-09 06:40:03,084 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-09 06:40:03,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 06:40:03,175 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-09 06:40:03,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:40:03,176 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:40:03,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112020422] [2024-11-09 06:40:03,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112020422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:40:03,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:40:03,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:40:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191619409] [2024-11-09 06:40:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:40:03,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:40:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:40:03,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:40:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:40:03,178 INFO L87 Difference]: Start difference. First operand 3019 states and 5133 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 06:40:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:06,736 INFO L93 Difference]: Finished difference Result 3018 states and 5132 transitions. [2024-11-09 06:40:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:40:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-09 06:40:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:06,743 INFO L225 Difference]: With dead ends: 3018 [2024-11-09 06:40:06,743 INFO L226 Difference]: Without dead ends: 3018 [2024-11-09 06:40:06,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-09 06:40:06,744 INFO L432 NwaCegarLoop]: 2911 mSDtfsCounter, 1 mSDsluCounter, 7482 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10393 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:06,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10393 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 06:40:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2024-11-09 06:40:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2024-11-09 06:40:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 1655 states have (on average 1.8876132930513596) internal successors, (3124), 3011 states have internal predecessors, (3124), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 06:40:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 5132 transitions. [2024-11-09 06:40:07,012 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 5132 transitions. Word has length 66 [2024-11-09 06:40:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:07,013 INFO L471 AbstractCegarLoop]: Abstraction has 3018 states and 5132 transitions. [2024-11-09 06:40:07,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 06:40:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 5132 transitions. [2024-11-09 06:40:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 06:40:07,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:07,014 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, 1, 1] [2024-11-09 06:40:07,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 06:40:07,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:07,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:40:07,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1264479340, now seen corresponding path program 1 times [2024-11-09 06:40:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:40:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399509112] [2024-11-09 06:40:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:07,217 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-09 06:40:07,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:40:07,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:07,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 06:40:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:07,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:40:07,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:07,616 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-09 06:40:07,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:40:07,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:40:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399509112] [2024-11-09 06:40:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399509112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:40:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:40:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:40:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992808247] [2024-11-09 06:40:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:40:07,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:40:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:40:07,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:40:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:40:07,620 INFO L87 Difference]: Start difference. First operand 3018 states and 5132 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-09 06:40:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:07,711 INFO L93 Difference]: Finished difference Result 3021 states and 5136 transitions. [2024-11-09 06:40:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:40:07,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-09 06:40:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:07,723 INFO L225 Difference]: With dead ends: 3021 [2024-11-09 06:40:07,723 INFO L226 Difference]: Without dead ends: 3021 [2024-11-09 06:40:07,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-09 06:40:07,724 INFO L432 NwaCegarLoop]: 2911 mSDtfsCounter, 0 mSDsluCounter, 5817 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8728 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-09 06:40:07,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8728 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:40:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2024-11-09 06:40:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3021. [2024-11-09 06:40:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 1657 states have (on average 1.8871454435727217) internal successors, (3127), 3014 states have internal predecessors, (3127), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:40:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 5136 transitions. [2024-11-09 06:40:08,011 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 5136 transitions. Word has length 74 [2024-11-09 06:40:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:08,011 INFO L471 AbstractCegarLoop]: Abstraction has 3021 states and 5136 transitions. [2024-11-09 06:40:08,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-09 06:40:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 5136 transitions. [2024-11-09 06:40:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 06:40:08,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:08,012 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, 1, 1, 1] [2024-11-09 06:40:08,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 06:40:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:08,217 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:40:08,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1128553124, now seen corresponding path program 1 times [2024-11-09 06:40:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:40:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804657687] [2024-11-09 06:40:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:08,218 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-09 06:40:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:40:08,221 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:08,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 06:40:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:08,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:40:08,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:08,621 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-09 06:40:08,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:08,718 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-09 06:40:08,718 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:40:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804657687] [2024-11-09 06:40:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804657687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [688348008] [2024-11-09 06:40:08,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:08,719 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:40:08,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:40:08,724 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:40:08,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-09 06:40:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:09,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:40:09,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:09,287 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-09 06:40:09,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:09,324 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-09 06:40:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [688348008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:09,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970096004] [2024-11-09 06:40:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:40:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:40:09,328 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:40:09,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 06:40:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:09,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:40:09,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:09,673 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-09 06:40:09,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:09,710 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-09 06:40:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970096004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:09,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:40:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-09 06:40:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32402384] [2024-11-09 06:40:09,711 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:40:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:40:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:40:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:40:09,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:40:09,713 INFO L87 Difference]: Start difference. First operand 3021 states and 5136 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 06:40:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:09,961 INFO L93 Difference]: Finished difference Result 3033 states and 5153 transitions. [2024-11-09 06:40:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:40:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-09 06:40:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:09,982 INFO L225 Difference]: With dead ends: 3033 [2024-11-09 06:40:09,982 INFO L226 Difference]: Without dead ends: 3033 [2024-11-09 06:40:09,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 438 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-09 06:40:09,983 INFO L432 NwaCegarLoop]: 2911 mSDtfsCounter, 8 mSDsluCounter, 8726 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11637 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:09,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11637 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:40:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2024-11-09 06:40:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 3031. [2024-11-09 06:40:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 1666 states have (on average 1.8859543817527011) internal successors, (3142), 3023 states have internal predecessors, (3142), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:40:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 5151 transitions. [2024-11-09 06:40:10,383 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 5151 transitions. Word has length 75 [2024-11-09 06:40:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 5151 transitions. [2024-11-09 06:40:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 06:40:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 5151 transitions. [2024-11-09 06:40:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:40:10,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:10,389 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, 1, 1, 1] [2024-11-09 06:40:10,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 06:40:10,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:10,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 06:40:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:10,990 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:40:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1432168556, now seen corresponding path program 2 times [2024-11-09 06:40:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:40:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875092627] [2024-11-09 06:40:10,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:40:10,992 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-09 06:40:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:40:10,996 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:10,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 06:40:11,664 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:40:11,664 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:40:11,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:40:11,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:11,752 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-09 06:40:11,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:11,961 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-09 06:40:11,961 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:40:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875092627] [2024-11-09 06:40:11,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875092627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:11,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606514695] [2024-11-09 06:40:11,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:40:11,962 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:40:11,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:40:11,967 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:40:11,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 06:40:13,711 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:40:13,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:40:13,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:40:13,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:13,774 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-09 06:40:13,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:13,866 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-09 06:40:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [606514695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746559121] [2024-11-09 06:40:13,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:40:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:40:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:40:13,870 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:40:13,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 06:40:26,046 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:40:26,046 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:40:26,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:40:26,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:26,211 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:40:26,211 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-09 06:40:26,248 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-09 06:40:26,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:40:26,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:40:26,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 06:40:26,639 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-09 06:40:26,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:26,769 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:40:26,769 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-09 06:40:26,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1586) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-09 06:40:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746559121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:40:26,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:40:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2024-11-09 06:40:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314677017] [2024-11-09 06:40:26,782 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:40:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 06:40:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:40:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 06:40:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-09 06:40:26,784 INFO L87 Difference]: Start difference. First operand 3031 states and 5151 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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-09 06:40:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:52,162 INFO L93 Difference]: Finished difference Result 3047 states and 5174 transitions. [2024-11-09 06:40:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 06:40:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 78 [2024-11-09 06:40:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:52,181 INFO L225 Difference]: With dead ends: 3047 [2024-11-09 06:40:52,181 INFO L226 Difference]: Without dead ends: 3043 [2024-11-09 06:40:52,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=413, Invalid=2242, Unknown=1, NotChecked=100, Total=2756 [2024-11-09 06:40:52,182 INFO L432 NwaCegarLoop]: 2587 mSDtfsCounter, 1678 mSDsluCounter, 27392 mSDsCounter, 0 mSdLazyCounter, 14179 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 29979 SdHoareTripleChecker+Invalid, 14697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 14179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:52,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 29979 Invalid, 14697 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [518 Valid, 14179 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2024-11-09 06:40:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2024-11-09 06:40:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 3039. [2024-11-09 06:40:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 1675 states have (on average 1.8823880597014926) internal successors, (3153), 3031 states have internal predecessors, (3153), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:40:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 5162 transitions. [2024-11-09 06:40:52,567 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 5162 transitions. Word has length 78 [2024-11-09 06:40:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:52,567 INFO L471 AbstractCegarLoop]: Abstraction has 3039 states and 5162 transitions. [2024-11-09 06:40:52,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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-09 06:40:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 5162 transitions. [2024-11-09 06:40:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 06:40:52,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:52,569 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, 1, 1, 1] [2024-11-09 06:40:52,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-09 06:40:52,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:53,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:40:53,173 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:40:53,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash 591856237, now seen corresponding path program 1 times [2024-11-09 06:40:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:40:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125616525] [2024-11-09 06:40:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:53,177 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-09 06:40:53,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:40:53,180 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:53,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 06:40:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:53,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:40:53,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:53,731 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-09 06:40:53,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:54,214 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-09 06:40:54,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:40:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125616525] [2024-11-09 06:40:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125616525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109437745] [2024-11-09 06:40:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:54,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:40:54,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:40:54,218 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:40:54,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 06:40:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:54,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:40:54,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:54,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-09 06:40:54,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:55,056 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-09 06:40:55,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [109437745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:55,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047175000] [2024-11-09 06:40:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:55,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:40:55,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:40:55,059 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:40:55,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 06:40:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:55,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:40:55,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:55,623 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-09 06:40:55,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:56,544 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-09 06:40:56,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047175000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:40:56,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:40:56,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-09 06:40:56,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289055385] [2024-11-09 06:40:56,546 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:40:56,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:40:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:40:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:40:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 06:40:56,548 INFO L87 Difference]: Start difference. First operand 3039 states and 5162 transitions. Second operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 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-09 06:40:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:58,992 INFO L93 Difference]: Finished difference Result 3065 states and 5203 transitions. [2024-11-09 06:40:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 06:40:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 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 84 [2024-11-09 06:40:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:59,002 INFO L225 Difference]: With dead ends: 3065 [2024-11-09 06:40:59,002 INFO L226 Difference]: Without dead ends: 3059 [2024-11-09 06:40:59,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 06:40:59,004 INFO L432 NwaCegarLoop]: 2911 mSDtfsCounter, 17 mSDsluCounter, 37804 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40715 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:59,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40715 Invalid, 679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:40:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2024-11-09 06:40:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 3057. [2024-11-09 06:40:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 1693 states have (on average 1.8759598346131128) internal successors, (3176), 3049 states have internal predecessors, (3176), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:40:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 5185 transitions. [2024-11-09 06:40:59,299 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 5185 transitions. Word has length 84 [2024-11-09 06:40:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 5185 transitions. [2024-11-09 06:40:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 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-09 06:40:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 5185 transitions. [2024-11-09 06:40:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 06:40:59,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:59,301 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, 1, 1, 1] [2024-11-09 06:40:59,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:59,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:59,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:59,902 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:40:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash -120048019, now seen corresponding path program 2 times [2024-11-09 06:40:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:40:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272289319] [2024-11-09 06:40:59,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:40:59,904 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-09 06:40:59,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:40:59,907 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:40:59,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-09 06:41:00,588 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:41:00,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:41:00,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:41:00,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:01,150 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-09 06:41:01,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:41:03,204 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-09 06:41:03,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:41:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272289319] [2024-11-09 06:41:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272289319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:41:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1177219180] [2024-11-09 06:41:03,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:41:03,205 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:41:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:41:03,208 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:41:03,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 06:41:05,215 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:41:05,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:41:05,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:41:05,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:05,338 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-09 06:41:05,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:41:05,744 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-09 06:41:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1177219180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:41:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760205457] [2024-11-09 06:41:05,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:41:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:41:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:41:05,747 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:41:05,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 06:41:29,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:41:29,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:41:29,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 06:41:29,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:29,455 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-09 06:41:29,468 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:41:29,469 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-09 06:41:29,581 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-09 06:41:29,589 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-09 06:41:29,911 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-09 06:41:29,917 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-09 06:41:30,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:41:30,656 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-09 06:41:30,663 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-09 06:41:30,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 31 treesize of output 13 [2024-11-09 06:41:30,848 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-09 06:41:30,944 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-09 06:41:30,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:41:31,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2888) |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_2887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-09 06:41:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760205457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:41:31,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:41:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2024-11-09 06:41:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151652761] [2024-11-09 06:41:31,798 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:41:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-09 06:41:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:41:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-09 06:41:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-09 06:41:31,801 INFO L87 Difference]: Start difference. First operand 3057 states and 5185 transitions. Second operand has 58 states, 57 states have (on average 3.1228070175438596) internal successors, (178), 58 states have internal predecessors, (178), 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-09 06:42:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:14,669 INFO L93 Difference]: Finished difference Result 3100 states and 5258 transitions. [2024-11-09 06:42:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-09 06:42:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.1228070175438596) internal successors, (178), 58 states have internal predecessors, (178), 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 96 [2024-11-09 06:42:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:14,678 INFO L225 Difference]: With dead ends: 3100 [2024-11-09 06:42:14,678 INFO L226 Difference]: Without dead ends: 3092 [2024-11-09 06:42:14,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3106, Invalid=14987, Unknown=1, NotChecked=266, Total=18360 [2024-11-09 06:42:14,684 INFO L432 NwaCegarLoop]: 2594 mSDtfsCounter, 1691 mSDsluCounter, 71541 mSDsCounter, 0 mSdLazyCounter, 16306 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 74135 SdHoareTripleChecker+Invalid, 16357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 16306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:14,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 74135 Invalid, 16357 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [51 Valid, 16306 Invalid, 0 Unknown, 0 Unchecked, 33.2s Time] [2024-11-09 06:42:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2024-11-09 06:42:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3090. [2024-11-09 06:42:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 1727 states have (on average 1.8627678054429646) internal successors, (3217), 3082 states have internal predecessors, (3217), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:42:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 5226 transitions. [2024-11-09 06:42:14,961 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 5226 transitions. Word has length 96 [2024-11-09 06:42:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:14,961 INFO L471 AbstractCegarLoop]: Abstraction has 3090 states and 5226 transitions. [2024-11-09 06:42:14,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.1228070175438596) internal successors, (178), 58 states have internal predecessors, (178), 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-09 06:42:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 5226 transitions. [2024-11-09 06:42:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:42:14,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:14,963 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-09 06:42:14,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-09 06:42:15,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-09 06:42:15,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 06:42:15,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:15,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:42:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 153559042, now seen corresponding path program 1 times [2024-11-09 06:42:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:42:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237825602] [2024-11-09 06:42:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:15,567 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-09 06:42:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:42:15,568 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:42:15,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 06:42:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:16,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 06:42:16,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:16,400 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-09 06:42:16,546 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:42:16,546 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-09 06:42:16,585 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-09 06:42:16,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 06:42:17,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:42:17,818 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-09 06:42:17,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:42:17,941 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-09 06:42:17,976 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-09 06:42:18,023 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-09 06:42:18,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:42:18,153 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3311 (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_3311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:42:18,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3311 (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_3357))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3311)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:42:18,615 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:42:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237825602] [2024-11-09 06:42:18,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237825602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2132528226] [2024-11-09 06:42:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:18,615 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:42:18,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:42:18,617 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:42:18,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 06:42:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:22,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 06:42:22,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:22,188 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-09 06:42:22,331 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:42:22,331 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-09 06:42:22,367 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-09 06:42:22,440 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-09 06:42:23,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:42:23,542 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-09 06:42:23,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:42:23,625 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-09 06:42:23,650 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-09 06:42:23,659 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-09 06:42:23,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:42:23,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3780 (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~mem38#1.base| v_ArrVal_3780) |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-09 06:42:23,692 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3780 (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_3780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:42:24,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3780 (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_3826))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3780)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:42:24,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2132528226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:24,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384595771] [2024-11-09 06:42:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:24,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:42:24,111 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:42:24,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 06:42:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:24,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 06:42:24,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:24,866 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:42:24,866 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-09 06:42:24,905 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-09 06:42:25,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:42:25,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 44 treesize of output 43 [2024-11-09 06:42:25,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:42:25,879 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-09 06:42:25,901 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-09 06:42:25,905 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-09 06:42:25,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:42:25,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4247 (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~mem38#1.base| v_ArrVal_4247) |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-09 06:42:25,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4247 (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_4247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:42:26,446 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 06:42:26,447 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-09 06:42:26,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4247 (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~mem36#1.base| v_ArrVal_4293))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4247)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-09 06:42:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384595771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:26,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:42:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 19 [2024-11-09 06:42:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443572383] [2024-11-09 06:42:26,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:42:26,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:42:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:42:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:42:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=389, Unknown=17, NotChecked=376, Total=870 [2024-11-09 06:42:26,463 INFO L87 Difference]: Start difference. First operand 3090 states and 5226 transitions. Second operand has 20 states, 17 states have (on average 7.352941176470588) internal successors, (125), 19 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:56,980 INFO L93 Difference]: Finished difference Result 3091 states and 5227 transitions. [2024-11-09 06:42:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:42:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.352941176470588) internal successors, (125), 19 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-09 06:42:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:56,989 INFO L225 Difference]: With dead ends: 3091 [2024-11-09 06:42:56,989 INFO L226 Difference]: Without dead ends: 3091 [2024-11-09 06:42:56,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=551, Unknown=18, NotChecked=440, Total=1122 [2024-11-09 06:42:56,991 INFO L432 NwaCegarLoop]: 2586 mSDtfsCounter, 1627 mSDsluCounter, 21431 mSDsCounter, 0 mSdLazyCounter, 16211 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 24017 SdHoareTripleChecker+Invalid, 16719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 16211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:56,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 24017 Invalid, 16719 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [508 Valid, 16211 Invalid, 0 Unknown, 0 Unchecked, 29.9s Time] [2024-11-09 06:42:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2024-11-09 06:42:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 3089. [2024-11-09 06:42:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 1727 states have (on average 1.8621887666473653) internal successors, (3216), 3081 states have internal predecessors, (3216), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:42:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5225 transitions. [2024-11-09 06:42:57,246 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5225 transitions. Word has length 121 [2024-11-09 06:42:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:57,247 INFO L471 AbstractCegarLoop]: Abstraction has 3089 states and 5225 transitions. [2024-11-09 06:42:57,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.352941176470588) internal successors, (125), 19 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5225 transitions. [2024-11-09 06:42:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:42:57,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:57,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] [2024-11-09 06:42:57,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-09 06:42:57,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-09 06:42:57,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 06:42:57,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:57,849 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:42:57,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash 153559043, now seen corresponding path program 1 times [2024-11-09 06:42:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:42:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110332423] [2024-11-09 06:42:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:57,850 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-09 06:42:57,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:42:57,852 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:42:57,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-09 06:42:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:58,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 06:42:58,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:58,825 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-09 06:42:59,004 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:42:59,005 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-09 06:42:59,016 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-09 06:42:59,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 13 treesize of output 9 [2024-11-09 06:42:59,054 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-09 06:42:59,191 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-09 06:42:59,197 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-09 06:43:00,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:43:00,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 62 treesize of output 57 [2024-11-09 06:43:00,037 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-09 06:43:00,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:43:00,180 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-09 06:43:00,186 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-09 06:43:00,224 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-09 06:43:00,230 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-09 06:43:00,266 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-09 06:43:00,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:43:00,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4763) |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~mem38#1.base| v_ArrVal_4762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:43:00,466 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_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:43:01,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4854))) (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~mem36#1.base| v_ArrVal_4855) .cse0 v_ArrVal_4763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4855) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4854) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-09 06:43:01,908 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:43:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110332423] [2024-11-09 06:43:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110332423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1617780141] [2024-11-09 06:43:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:01,909 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:43:01,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:43:01,910 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:43:01,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-09 06:44:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:44:29,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 06:44:29,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:44:29,084 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-09 06:44:29,213 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:44:29,213 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-09 06:44:29,219 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-09 06:44:29,229 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-09 06:44:29,241 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-09 06:44:29,302 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-09 06:44:29,308 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-09 06:44:30,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:30,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:44:30,077 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-09 06:44:30,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:30,158 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-09 06:44:30,164 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-09 06:44:30,194 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-09 06:44:30,199 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-09 06:44:30,206 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-09 06:44:30,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:44:30,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:44:30,284 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_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:44:31,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5417))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5416) .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5416) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2024-11-09 06:44:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1617780141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:44:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667015157] [2024-11-09 06:44:31,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:44:31,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:44:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:44:31,807 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:44:31,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 06:44:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:44:32,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 06:44:32,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:44:32,699 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:44:32,699 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-09 06:44:32,708 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-09 06:44:32,724 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-09 06:44:32,730 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-09 06:44:32,831 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-09 06:44:32,837 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-09 06:44:33,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:33,640 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-09 06:44:33,645 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-09 06:44:33,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:33,717 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-09 06:44:33,723 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-09 06:44:33,758 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-09 06:44:33,765 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-09 06:44:33,772 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-09 06:44:33,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:44:33,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:44:33,876 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_5885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-09 06:44:35,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5977))) (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~mem36#1.base| v_ArrVal_5978) .cse0 v_ArrVal_5886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5978) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-09 06:44:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667015157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:44:35,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:44:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 10 [2024-11-09 06:44:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569370366] [2024-11-09 06:44:35,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:44:35,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:44:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:44:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:44:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=135, Unknown=9, NotChecked=270, Total=462 [2024-11-09 06:44:35,389 INFO L87 Difference]: Start difference. First operand 3089 states and 5225 transitions. Second operand has 11 states, 9 states have (on average 11.88888888888889) internal successors, (107), 11 states have internal predecessors, (107), 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-09 06:44:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:44:52,883 INFO L93 Difference]: Finished difference Result 3088 states and 5224 transitions. [2024-11-09 06:44:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:44:52,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 11.88888888888889) internal successors, (107), 11 states have internal predecessors, (107), 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-09 06:44:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:44:52,894 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 06:44:52,894 INFO L226 Difference]: Without dead ends: 3088 [2024-11-09 06:44:52,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 356 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=286, Unknown=9, NotChecked=378, Total=756 [2024-11-09 06:44:52,895 INFO L432 NwaCegarLoop]: 2594 mSDtfsCounter, 1625 mSDsluCounter, 13796 mSDsCounter, 0 mSdLazyCounter, 7599 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 16390 SdHoareTripleChecker+Invalid, 7605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:44:52,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 16390 Invalid, 7605 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 7599 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2024-11-09 06:44:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2024-11-09 06:44:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3088. [2024-11-09 06:44:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 1727 states have (on average 1.861609727851766) internal successors, (3215), 3080 states have internal predecessors, (3215), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:44:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 5224 transitions. [2024-11-09 06:44:53,253 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 5224 transitions. Word has length 121 [2024-11-09 06:44:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:44:53,253 INFO L471 AbstractCegarLoop]: Abstraction has 3088 states and 5224 transitions. [2024-11-09 06:44:53,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 11.88888888888889) internal successors, (107), 11 states have internal predecessors, (107), 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-09 06:44:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 5224 transitions. [2024-11-09 06:44:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:44:53,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:44:53,255 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-09 06:44:53,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 06:44:53,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-09 06:44:53,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-09 06:44:53,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:44:53,856 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:44:53,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:44:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash 537553875, now seen corresponding path program 1 times [2024-11-09 06:44:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:44:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435440535] [2024-11-09 06:44:53,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:44:53,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:44:53,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:44:53,861 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:44:53,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-09 06:44:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:44:54,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 06:44:54,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:44:54,966 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-09 06:44:55,162 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:44:55,163 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-09 06:44:55,197 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-09 06:44:55,323 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-09 06:44:56,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:56,267 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-09 06:44:56,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:56,376 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-09 06:44:56,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:56,464 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-09 06:44:56,489 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-09 06:44:56,527 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-09 06:44:56,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:44:56,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6417 (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~mem39#1.base| v_ArrVal_6417) |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-09 06:44:56,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6417 (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_6417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:44:56,601 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6417 (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~mem38#1.base| v_ArrVal_6416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:44:56,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6417 (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_6416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:44:57,015 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6463 (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~mem36#1.base| v_ArrVal_6463))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:44:57,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:44:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435440535] [2024-11-09 06:44:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435440535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:44:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236945034] [2024-11-09 06:44:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:44:57,020 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:44:57,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:44:57,021 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:44:57,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-09 06:45:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:16,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 06:45:16,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:45:16,593 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-09 06:45:16,729 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:45:16,729 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-09 06:45:16,748 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-09 06:45:16,827 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-09 06:45:17,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:17,728 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-09 06:45:17,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:17,827 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-09 06:45:17,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:17,902 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-09 06:45:17,935 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-09 06:45:17,947 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-09 06:45:17,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:45:18,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6902 (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_6902) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:45:18,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (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~mem38#1.base| v_ArrVal_6901))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6902)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:45:18,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (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_6901))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6902)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:45:18,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (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~mem36#1.base| v_ArrVal_6948))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6901)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6902)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:45:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1236945034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:45:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448695586] [2024-11-09 06:45:18,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:18,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:45:18,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:45:18,518 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:45:18,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-09 06:45:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:19,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 06:45:19,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:45:19,496 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:45:19,496 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-09 06:45:19,528 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-09 06:45:19,914 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:19,914 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-09 06:45:20,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:20,004 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-09 06:45:20,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:20,079 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-09 06:45:20,138 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-09 06:45:20,142 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-09 06:45:20,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:45:20,166 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:45:20,166 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-09 06:45:20,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7385 (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_7385) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 06:45:20,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7384)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7385) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-09 06:45:20,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7384))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7385) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:45:20,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7431 (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~mem36#1.base| v_ArrVal_7431))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7384)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7385) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:45:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448695586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:45:20,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:45:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 20 [2024-11-09 06:45:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530151163] [2024-11-09 06:45:20,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:45:20,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 06:45:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:45:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 06:45:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=462, Unknown=33, NotChecked=728, Total=1332 [2024-11-09 06:45:20,665 INFO L87 Difference]: Start difference. First operand 3088 states and 5224 transitions. Second operand has 21 states, 18 states have (on average 7.277777777777778) internal successors, (131), 21 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:45:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:53,843 INFO L93 Difference]: Finished difference Result 3089 states and 5225 transitions. [2024-11-09 06:45:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:45:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.277777777777778) internal successors, (131), 21 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 124 [2024-11-09 06:45:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:53,852 INFO L225 Difference]: With dead ends: 3089 [2024-11-09 06:45:53,852 INFO L226 Difference]: Without dead ends: 3089 [2024-11-09 06:45:53,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=546, Unknown=34, NotChecked=780, Total=1482 [2024-11-09 06:45:53,853 INFO L432 NwaCegarLoop]: 2587 mSDtfsCounter, 1626 mSDsluCounter, 21505 mSDsCounter, 0 mSdLazyCounter, 15628 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 24092 SdHoareTripleChecker+Invalid, 16136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 15628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:53,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 24092 Invalid, 16136 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [508 Valid, 15628 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2024-11-09 06:45:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2024-11-09 06:45:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3087. [2024-11-09 06:45:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 1727 states have (on average 1.8610306890561668) internal successors, (3214), 3079 states have internal predecessors, (3214), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:45:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 5223 transitions. [2024-11-09 06:45:54,275 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 5223 transitions. Word has length 124 [2024-11-09 06:45:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:54,276 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 5223 transitions. [2024-11-09 06:45:54,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.277777777777778) internal successors, (131), 21 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:45:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 5223 transitions. [2024-11-09 06:45:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:45:54,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:54,277 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-09 06:45:54,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-09 06:45:54,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2024-11-09 06:45:54,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-09 06:45:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:45:54,880 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:45:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 537553876, now seen corresponding path program 1 times [2024-11-09 06:45:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:45:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138325246] [2024-11-09 06:45:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:54,884 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-09 06:45:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:45:54,887 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:45:54,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-11-09 06:45:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:56,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 06:45:56,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:45:56,096 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-09 06:45:56,264 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:45:56,264 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-09 06:45:56,273 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-09 06:45:56,308 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-09 06:45:56,315 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-09 06:45:56,443 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-09 06:45:56,448 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-09 06:45:57,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:57,318 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-09 06:45:57,334 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-09 06:45:57,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:57,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 62 treesize of output 57 [2024-11-09 06:45:57,499 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-09 06:45:57,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:45:57,641 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-09 06:45:57,648 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-09 06:45:57,691 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-09 06:45:57,697 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-09 06:45:57,743 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-09 06:45:57,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:45:57,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-09 06:45:57,942 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_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 06:45:57,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7915 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7916))) (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~mem38#1.base| v_ArrVal_7915) .cse0 v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7915 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7915) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-09 06:45:58,025 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_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7915 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7915) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7915 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7916))) (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_7915) .cse3 v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:45:59,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8009))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7916))) (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~mem36#1.base| v_ArrVal_8010) .cse0 v_ArrVal_7915) .cse1 v_ArrVal_7918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8009))) (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~mem36#1.base| v_ArrVal_8010) .cse6 v_ArrVal_7915) (select (select (store .cse7 .cse6 v_ArrVal_7916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7918))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-09 06:45:59,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:45:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138325246] [2024-11-09 06:45:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138325246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:45:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [210027032] [2024-11-09 06:45:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:59,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:45:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:45:59,469 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:45:59,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-09 06:48:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:08,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-09 06:48:08,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:48:08,128 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-09 06:48:08,263 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:48:08,264 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-09 06:48:08,271 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-09 06:48:08,281 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-09 06:48:08,286 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-09 06:48:08,354 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-09 06:48:08,358 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-09 06:48:09,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:48:09,106 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-09 06:48:09,113 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-09 06:48:09,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:48:09,196 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-09 06:48:09,201 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-09 06:48:09,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:48:09,264 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-09 06:48:09,269 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-09 06:48:09,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 06:48:09,302 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-09 06:48:09,309 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-09 06:48:09,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:48:09,501 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_8496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8497 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8497) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8496 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 06:48:09,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_8496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8497 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8495))) (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~mem38#1.base| v_ArrVal_8494) .cse0 v_ArrVal_8496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8497) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8494 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8494) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-09 06:48:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [210027032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:48:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48614623] [2024-11-09 06:48:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:48:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:48:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:48:15,028 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:48:15,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-09 06:48:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:15,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 06:48:15,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:48:16,499 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-09 06:48:16,560 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:48:16,561 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-09 06:48:16,585 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-09 06:48:16,608 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-09 06:48:16,782 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-09 06:48:16,794 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-09 06:48:18,887 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:48:18,887 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-09 06:48:18,899 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-09 06:48:19,111 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:48:19,111 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-09 06:48:19,123 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-09 06:48:19,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:48:19,290 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-09 06:48:19,302 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-09 06:48:19,376 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-09 06:48:19,387 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-09 06:48:19,406 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-09 06:48:19,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:48:19,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-09 06:48:19,563 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_9075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 06:48:19,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9072) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9073))) (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~mem38#1.base| v_ArrVal_9072) .cse2 v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:48:19,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9073))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9072) .cse1 v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9072) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 06:48:22,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9166))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9073))) (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~mem36#1.base| v_ArrVal_9167) .cse0 v_ArrVal_9072) .cse1 v_ArrVal_9074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9166))) (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~mem36#1.base| v_ArrVal_9167) .cse6 v_ArrVal_9072) (select (select (store .cse7 .cse6 v_ArrVal_9073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9074))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-09 06:48:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48614623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:48:22,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:48:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 11 [2024-11-09 06:48:22,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026791734] [2024-11-09 06:48:22,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:48:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:48:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:48:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:48:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=218, Unknown=32, NotChecked=492, Total=812 [2024-11-09 06:48:22,419 INFO L87 Difference]: Start difference. First operand 3087 states and 5223 transitions. Second operand has 12 states, 10 states have (on average 11.0) internal successors, (110), 12 states have internal predecessors, (110), 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-09 06:49:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:15,917 INFO L93 Difference]: Finished difference Result 3086 states and 5222 transitions. [2024-11-09 06:49:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:49:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 11.0) internal successors, (110), 12 states have internal predecessors, (110), 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 124 [2024-11-09 06:49:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:15,926 INFO L225 Difference]: With dead ends: 3086 [2024-11-09 06:49:15,926 INFO L226 Difference]: Without dead ends: 3086 [2024-11-09 06:49:15,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 367 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=119, Invalid=448, Unknown=33, NotChecked=660, Total=1260 [2024-11-09 06:49:15,927 INFO L432 NwaCegarLoop]: 2593 mSDtfsCounter, 1623 mSDsluCounter, 15655 mSDsCounter, 0 mSdLazyCounter, 8641 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 18248 SdHoareTripleChecker+Invalid, 8647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:15,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 18248 Invalid, 8647 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 8641 Invalid, 0 Unknown, 0 Unchecked, 52.0s Time] [2024-11-09 06:49:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2024-11-09 06:49:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2024-11-09 06:49:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 1727 states have (on average 1.8604516502605675) internal successors, (3213), 3078 states have internal predecessors, (3213), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:49:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 5222 transitions. [2024-11-09 06:49:16,277 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 5222 transitions. Word has length 124 [2024-11-09 06:49:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:16,278 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 5222 transitions. [2024-11-09 06:49:16,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 11.0) internal successors, (110), 12 states have internal predecessors, (110), 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-09 06:49:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 5222 transitions. [2024-11-09 06:49:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:49:16,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:16,280 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, 1, 1, 1] [2024-11-09 06:49:16,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2024-11-09 06:49:16,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2024-11-09 06:49:16,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-09 06:49:16,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:49:16,881 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:49:16,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1665245815, now seen corresponding path program 1 times [2024-11-09 06:49:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:49:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234373127] [2024-11-09 06:49:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:16,882 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-09 06:49:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:49:16,884 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:49:16,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2024-11-09 06:49:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:18,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 06:49:18,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:49:18,147 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-09 06:49:18,831 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:49:18,831 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-09 06:49:18,926 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-09 06:49:19,272 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-09 06:49:22,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:49:22,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:49:22,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:49:22,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:49:22,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:49:22,817 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-09 06:49:23,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:49:23,182 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-09 06:49:23,265 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-09 06:49:23,401 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-09 06:49:23,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:49:23,793 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9622 (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_9622) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:49:23,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-09 06:49:23,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9621 (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_9621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:49:23,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9620))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:49:23,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9620 (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_9620))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:49:24,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9620 (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~mem36#1.base| v_ArrVal_9668))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9620)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:49:24,808 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:49:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234373127] [2024-11-09 06:49:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234373127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:49:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030427751] [2024-11-09 06:49:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:24,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:49:24,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:49:24,810 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:49:24,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2024-11-09 06:50:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:19,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 06:50:19,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:19,500 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-09 06:50:20,205 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:50:20,205 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-09 06:50:20,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:50:20,483 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-09 06:50:23,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:23,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 44 treesize of output 43 [2024-11-09 06:50:23,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:23,627 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-09 06:50:23,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:23,828 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-09 06:50:24,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:24,023 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-09 06:50:24,106 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-09 06:50:24,139 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-09 06:50:24,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:50:24,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (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~mem39#1.base| v_ArrVal_10122))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:50:24,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (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_10122))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:50:24,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10121))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10122)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-09 06:50:24,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (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_10121))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10122)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:50:25,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (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~mem36#1.base| v_ArrVal_10169))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10121)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10122)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:50:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2030427751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126035850] [2024-11-09 06:50:25,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:25,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:25,492 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:25,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-09 06:50:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:26,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 06:50:26,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:27,114 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:50:27,114 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-09 06:50:27,254 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-09 06:50:28,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:28,728 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-09 06:50:29,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:29,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 06:50:29,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:29,289 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-09 06:50:29,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:50:29,808 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-09 06:50:29,865 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-09 06:50:29,877 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-09 06:50:29,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:50:30,176 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 06:50:30,176 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-09 06:50:30,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (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~mem39#1.base| v_ArrVal_10621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2024-11-09 06:50:30,248 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_10621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)))) is different from false [2024-11-09 06:50:30,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10620)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_10621))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 06:50:30,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10620))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_10621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-09 06:50:31,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9622 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10668))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10620)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_10621))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:50:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126035850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:31,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:50:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 22 [2024-11-09 06:50:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725304046] [2024-11-09 06:50:31,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:50:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:50:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:50:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=516, Unknown=23, NotChecked=976, Total=1640 [2024-11-09 06:50:31,310 INFO L87 Difference]: Start difference. First operand 3086 states and 5222 transitions. Second operand has 23 states, 20 states have (on average 6.85) internal successors, (137), 23 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:51:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:51:42,401 INFO L93 Difference]: Finished difference Result 3087 states and 5223 transitions. [2024-11-09 06:51:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:51:42,402 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.85) internal successors, (137), 23 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-09 06:51:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:51:42,413 INFO L225 Difference]: With dead ends: 3087 [2024-11-09 06:51:42,413 INFO L226 Difference]: Without dead ends: 3087 [2024-11-09 06:51:42,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 373 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=138, Invalid=605, Unknown=23, NotChecked=1040, Total=1806 [2024-11-09 06:51:42,415 INFO L432 NwaCegarLoop]: 2586 mSDtfsCounter, 1625 mSDsluCounter, 15128 mSDsCounter, 0 mSdLazyCounter, 11651 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 17714 SdHoareTripleChecker+Invalid, 12663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 11651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:51:42,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 17714 Invalid, 12663 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1012 Valid, 11651 Invalid, 0 Unknown, 0 Unchecked, 70.4s Time] [2024-11-09 06:51:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2024-11-09 06:51:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3085. [2024-11-09 06:51:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 1727 states have (on average 1.8598726114649682) internal successors, (3212), 3077 states have internal predecessors, (3212), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 06:51:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 5221 transitions. [2024-11-09 06:51:42,865 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 5221 transitions. Word has length 127 [2024-11-09 06:51:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:51:42,866 INFO L471 AbstractCegarLoop]: Abstraction has 3085 states and 5221 transitions. [2024-11-09 06:51:42,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.85) internal successors, (137), 23 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:51:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 5221 transitions. [2024-11-09 06:51:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:51:42,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:51:42,868 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, 1, 1, 1] [2024-11-09 06:51:42,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2024-11-09 06:51:43,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2024-11-09 06:51:43,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2024-11-09 06:51:43,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:51:43,469 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:51:43,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1665245814, now seen corresponding path program 1 times [2024-11-09 06:51:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:51:43,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115694001] [2024-11-09 06:51:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:43,471 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-09 06:51:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:51:43,472 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -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-09 06:51:43,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2024-11-09 06:51:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:44,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 06:51:44,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:51:44,933 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-09 06:51:45,539 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-09 06:51:45,596 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:51:45,596 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-09 06:51:45,674 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-09 06:51:45,700 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-09 06:51:46,042 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-09 06:51:46,054 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-09 06:51:48,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:51:48,478 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-09 06:51:48,492 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-09 06:51:48,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:51:48,842 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-09 06:51:48,857 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-09 06:51:49,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:51:49,179 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-09 06:51:49,193 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-09 06:51:49,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:51:49,524 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-09 06:51:49,538 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-09 06:51:49,631 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-09 06:51:49,645 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-09 06:51:49,792 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-09 06:51:49,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:51:50,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-09 06:51:50,230 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_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:51:50,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11170) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11169))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11170) .cse2 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:51:50,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11169))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11170) .cse1 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11170) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-09 06:51:50,976 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11167))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11168) .cse1 v_ArrVal_11170) (select (select (store .cse2 .cse1 v_ArrVal_11169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11171))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11167))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11169))) (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~mem38#1.base| v_ArrVal_11168) .cse4 v_ArrVal_11170) .cse5 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 06:51:51,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11167))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11168) .cse2 v_ArrVal_11170) (select (select (store .cse3 .cse2 v_ArrVal_11169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11171))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11167))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11169))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11168) .cse5 v_ArrVal_11170) .cse6 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 06:51:56,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11264))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11167))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11169))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11263) .cse0 v_ArrVal_11168) .cse1 v_ArrVal_11170) .cse2 v_ArrVal_11171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11264))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11167))) (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~mem36#1.base| v_ArrVal_11263) .cse8 v_ArrVal_11168) .cse9 v_ArrVal_11170) (select (select (store .cse10 .cse9 v_ArrVal_11169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11171))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-09 06:51:56,863 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:51:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115694001] [2024-11-09 06:51:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115694001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:51:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [306349158] [2024-11-09 06:51:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:56,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:51:56,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:51:56,865 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:51:56,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ef6efe8-2948-4c26-af63-d7cf6b5e65e8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process