./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/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 c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:12:58,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:12:58,122 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:12:58,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:12:58,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:12:58,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:12:58,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:12:58,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:12:58,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:12:58,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:12:58,161 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:12:58,161 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:12:58,162 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:12:58,162 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:12:58,175 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:12:58,175 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:12:58,176 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:12:58,176 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:12:58,177 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:12:58,177 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:12:58,178 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:12:58,183 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:12:58,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:12:58,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:12:58,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:12:58,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:12:58,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:12:58,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:12:58,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:12:58,185 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:12:58,185 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:12:58,186 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:12:58,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:12:58,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:12:58,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:12:58,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:12:58,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:12:58,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:12:58,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:12:58,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:12:58,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:12:58,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:12:58,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:12:58,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:12:58,194 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:12:58,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:12:58,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:12:58,195 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:12:58,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:12:58,196 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_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/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 -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2024-11-09 06:12:58,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:12:58,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:12:58,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:12:58,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:12:58,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:12:58,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i Unable to find full path for "g++" [2024-11-09 06:13:00,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:13:00,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:13:00,861 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-11-09 06:13:00,890 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data/3be7b79a8/6d492b35f53d487cbd43c77003987990/FLAGc99825ece [2024-11-09 06:13:01,137 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data/3be7b79a8/6d492b35f53d487cbd43c77003987990 [2024-11-09 06:13:01,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:13:01,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:13:01,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:13:01,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:13:01,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:13:01,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:01" (1/1) ... [2024-11-09 06:13:01,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7660089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01, skipping insertion in model container [2024-11-09 06:13:01,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:01" (1/1) ... [2024-11-09 06:13:01,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:13:01,754 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:13:01,809 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:13:01,820 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:13:01,827 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:13:01,840 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:13:01,901 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:13:01,905 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:13:01,908 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:13:01,911 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:13:01,915 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:13:01,919 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:13:01,920 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:13:01,925 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:13:01,933 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:13:01,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:13:01,967 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:13:01,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@39f39949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01, skipping insertion in model container [2024-11-09 06:13:01,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:13:01,973 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 06:13:01,975 INFO L158 Benchmark]: Toolchain (without parser) took 832.86ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 65.2MB in the beginning and 123.5MB in the end (delta: -58.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-09 06:13:01,978 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:13:01,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 830.93ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 64.9MB in the beginning and 123.5MB in the end (delta: -58.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-09 06:13:01,981 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.20ms. Allocated memory is still 130.0MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 830.93ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 64.9MB in the beginning and 123.5MB in the end (delta: -58.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/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 c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:13:04,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:13:04,404 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 06:13:04,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:13:04,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:13:04,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:13:04,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:13:04,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:13:04,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:13:04,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:13:04,458 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:13:04,458 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:13:04,458 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:13:04,459 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:13:04,459 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:13:04,459 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:13:04,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:13:04,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:13:04,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:13:04,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:13:04,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:13:04,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:13:04,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:13:04,469 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:13:04,469 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:13:04,469 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:13:04,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:13:04,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:13:04,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:13:04,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:13:04,471 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:13:04,471 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:13:04,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:13:04,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:13:04,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:13:04,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:13:04,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:13:04,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:13:04,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:13:04,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:13:04,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:13:04,475 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:13:04,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:13:04,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:13:04,475 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:13:04,475 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_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/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 -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2024-11-09 06:13:04,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:13:04,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:13:04,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:13:04,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:13:04,876 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:13:04,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i Unable to find full path for "g++" [2024-11-09 06:13:06,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:13:07,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:13:07,190 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-11-09 06:13:07,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data/61fcb1a14/f338fc38e1a34e3c9de2825b9cf6f228/FLAG9c79bba69 [2024-11-09 06:13:07,232 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/data/61fcb1a14/f338fc38e1a34e3c9de2825b9cf6f228 [2024-11-09 06:13:07,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:13:07,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:13:07,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:13:07,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:13:07,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:13:07,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:07" (1/1) ... [2024-11-09 06:13:07,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13807442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:07, skipping insertion in model container [2024-11-09 06:13:07,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:07" (1/1) ... [2024-11-09 06:13:07,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:13:07,915 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:13:07,966 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:13:07,976 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:13:07,984 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:13:08,000 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:13:08,054 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:13:08,054 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:13:08,060 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:13:08,061 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:13:08,065 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:13:08,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:13:08,073 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:13:08,075 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:13:08,083 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:13:08,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:13:08,119 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 06:13:08,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:13:08,204 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:13:08,242 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:13:08,244 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:13:08,249 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:13:08,258 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:13:08,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:13:08,302 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:13:08,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:13:08,305 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:13:08,313 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:13:08,314 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:13:08,319 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:13:08,320 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:13:08,325 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:13:08,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:13:08,337 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:13:08,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:13:08,479 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:13:08,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08 WrapperNode [2024-11-09 06:13:08,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:13:08,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:13:08,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:13:08,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:13:08,489 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:13:08" (1/1) ... [2024-11-09 06:13:08,531 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:13:08" (1/1) ... [2024-11-09 06:13:08,619 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1002 [2024-11-09 06:13:08,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:13:08,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:13:08,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:13:08,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:13:08,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:13:08,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:13:08,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:13:08,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:13:08,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (1/1) ... [2024-11-09 06:13:08,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:13:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:13:08,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:08,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:13:08,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:13:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 06:13:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 06:13:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 06:13:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 06:13:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:13:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:13:08,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:13:09,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:13:09,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:13:09,110 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 06:13:13,758 INFO L? ?]: Removed 1072 outVars from TransFormulas that were not future-live. [2024-11-09 06:13:13,759 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:13:13,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:13:13,805 INFO L316 CfgBuilder]: Removed 58 assume(true) statements. [2024-11-09 06:13:13,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:13:13 BoogieIcfgContainer [2024-11-09 06:13:13,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:13:13,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:13:13,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:13:13,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:13:13,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:13:07" (1/3) ... [2024-11-09 06:13:13,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5087365a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:13:13, skipping insertion in model container [2024-11-09 06:13:13,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:08" (2/3) ... [2024-11-09 06:13:13,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5087365a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:13:13, skipping insertion in model container [2024-11-09 06:13:13,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:13:13" (3/3) ... [2024-11-09 06:13:13,821 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-1.i [2024-11-09 06:13:13,838 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:13:13,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 523 error locations. [2024-11-09 06:13:13,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:13:13,930 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;@26a841b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:13:13,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 523 error locations. [2024-11-09 06:13:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 1057 states, 529 states have (on average 2.215500945179584) internal successors, (1172), 1050 states have internal predecessors, (1172), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:13:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:13:13,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:13,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:13:13,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 47731, now seen corresponding path program 1 times [2024-11-09 06:13:13,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:13,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547926540] [2024-11-09 06:13:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:13,965 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:13:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:13,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:13,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:14,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:13:14,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:14,201 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:13:14,219 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:13:14,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:14,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:14,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547926540] [2024-11-09 06:13:14,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547926540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:14,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:14,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:13:14,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28883782] [2024-11-09 06:13:14,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:14,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:14,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:14,295 INFO L87 Difference]: Start difference. First operand has 1057 states, 529 states have (on average 2.215500945179584) internal successors, (1172), 1050 states have internal predecessors, (1172), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:13:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:16,345 INFO L93 Difference]: Finished difference Result 1048 states and 1109 transitions. [2024-11-09 06:13:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:16,358 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:13:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:16,405 INFO L225 Difference]: With dead ends: 1048 [2024-11-09 06:13:16,406 INFO L226 Difference]: Without dead ends: 1046 [2024-11-09 06:13:16,407 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:13:16,415 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 967 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:16,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 690 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 06:13:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-09 06:13:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1038. [2024-11-09 06:13:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 529 states have (on average 2.062381852551985) internal successors, (1091), 1032 states have internal predecessors, (1091), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1099 transitions. [2024-11-09 06:13:16,545 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1099 transitions. Word has length 3 [2024-11-09 06:13:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:16,546 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1099 transitions. [2024-11-09 06:13:16,546 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:13:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1099 transitions. [2024-11-09 06:13:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:13:16,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:16,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:13:16,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:13:16,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:16,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:16,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 47732, now seen corresponding path program 1 times [2024-11-09 06:13:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200361765] [2024-11-09 06:13:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:16,751 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:13:16,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:16,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:16,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:16,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:16,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:16,876 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:13:16,894 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:13:16,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:16,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200361765] [2024-11-09 06:13:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200361765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:13:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705799372] [2024-11-09 06:13:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:16,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:16,898 INFO L87 Difference]: Start difference. First operand 1038 states and 1099 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:13:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:19,880 INFO L93 Difference]: Finished difference Result 1438 states and 1534 transitions. [2024-11-09 06:13:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:19,881 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:13:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:19,887 INFO L225 Difference]: With dead ends: 1438 [2024-11-09 06:13:19,887 INFO L226 Difference]: Without dead ends: 1438 [2024-11-09 06:13:19,887 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:13:19,888 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 432 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:19,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1480 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 06:13:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-09 06:13:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1249. [2024-11-09 06:13:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 741 states have (on average 2.048582995951417) internal successors, (1518), 1243 states have internal predecessors, (1518), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1526 transitions. [2024-11-09 06:13:19,921 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1526 transitions. Word has length 3 [2024-11-09 06:13:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1526 transitions. [2024-11-09 06:13:19,922 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:13:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1526 transitions. [2024-11-09 06:13:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:13:19,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:19,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:19,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Ended with exit code 0 [2024-11-09 06:13:20,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:20,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:20,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1130822653, now seen corresponding path program 1 times [2024-11-09 06:13:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839057292] [2024-11-09 06:13:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:20,125 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:13:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:20,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:20,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:20,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:13:20,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:20,279 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:13:20,288 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:13:20,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:20,379 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:13:20,402 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:13:20,402 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:13:20,436 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:13:20,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:20,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839057292] [2024-11-09 06:13:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839057292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:20,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:20,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361332114] [2024-11-09 06:13:20,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:20,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:20,439 INFO L87 Difference]: Start difference. First operand 1249 states and 1526 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:13:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:23,497 INFO L93 Difference]: Finished difference Result 1251 states and 1530 transitions. [2024-11-09 06:13:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:23,498 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:13:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:23,502 INFO L225 Difference]: With dead ends: 1251 [2024-11-09 06:13:23,502 INFO L226 Difference]: Without dead ends: 1251 [2024-11-09 06:13:23,502 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:13:23,503 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 2023 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:23,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 402 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 06:13:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-09 06:13:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1026. [2024-11-09 06:13:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 529 states have (on average 2.0378071833648392) internal successors, (1078), 1020 states have internal predecessors, (1078), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1086 transitions. [2024-11-09 06:13:23,526 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1086 transitions. Word has length 7 [2024-11-09 06:13:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1086 transitions. [2024-11-09 06:13:23,527 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:13:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1086 transitions. [2024-11-09 06:13:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:13:23,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:23,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:23,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:23,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 695763858, now seen corresponding path program 1 times [2024-11-09 06:13:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953354343] [2024-11-09 06:13:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:23,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:13:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:23,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:23,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:23,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:13:23,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:23,870 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:13:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:13:23,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:23,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953354343] [2024-11-09 06:13:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953354343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:23,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:13:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447962627] [2024-11-09 06:13:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:23,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:23,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:23,888 INFO L87 Difference]: Start difference. First operand 1026 states and 1086 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:13:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:26,240 INFO L93 Difference]: Finished difference Result 1363 states and 1455 transitions. [2024-11-09 06:13:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:26,240 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:13:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:26,244 INFO L225 Difference]: With dead ends: 1363 [2024-11-09 06:13:26,244 INFO L226 Difference]: Without dead ends: 1363 [2024-11-09 06:13:26,245 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:13:26,246 INFO L432 NwaCegarLoop]: 953 mSDtfsCounter, 933 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:26,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1201 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 06:13:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2024-11-09 06:13:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 979. [2024-11-09 06:13:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 529 states have (on average 1.9489603024574669) internal successors, (1031), 973 states have internal predecessors, (1031), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1039 transitions. [2024-11-09 06:13:26,268 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1039 transitions. Word has length 8 [2024-11-09 06:13:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:26,269 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1039 transitions. [2024-11-09 06:13:26,269 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:13:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1039 transitions. [2024-11-09 06:13:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:13:26,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:26,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:26,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:26,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:26,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash 695763859, now seen corresponding path program 1 times [2024-11-09 06:13:26,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:26,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462114247] [2024-11-09 06:13:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:26,472 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:13:26,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:26,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:26,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:26,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:26,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:26,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:13:26,638 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:13:26,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:26,639 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462114247] [2024-11-09 06:13:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462114247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:26,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:26,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:13:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449226769] [2024-11-09 06:13:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:26,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:26,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:26,641 INFO L87 Difference]: Start difference. First operand 979 states and 1039 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:13:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:29,453 INFO L93 Difference]: Finished difference Result 1453 states and 1548 transitions. [2024-11-09 06:13:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:29,453 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:13:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:29,457 INFO L225 Difference]: With dead ends: 1453 [2024-11-09 06:13:29,457 INFO L226 Difference]: Without dead ends: 1453 [2024-11-09 06:13:29,457 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:13:29,458 INFO L432 NwaCegarLoop]: 1145 mSDtfsCounter, 698 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:29,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1569 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:13:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-09 06:13:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1006. [2024-11-09 06:13:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 566 states have (on average 1.9346289752650176) internal successors, (1095), 1000 states have internal predecessors, (1095), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1103 transitions. [2024-11-09 06:13:29,480 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1103 transitions. Word has length 8 [2024-11-09 06:13:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1103 transitions. [2024-11-09 06:13:29,481 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:13:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1103 transitions. [2024-11-09 06:13:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:13:29,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:29,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:29,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:29,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:29,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr521ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash 190293527, now seen corresponding path program 1 times [2024-11-09 06:13:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922725896] [2024-11-09 06:13:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:29,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:13:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:29,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:29,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:29,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:29,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:29,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:29,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:13:29,880 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:13:29,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:13:29,950 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:13:29,996 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:13:29,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:29,997 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:29,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922725896] [2024-11-09 06:13:29,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922725896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:29,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:29,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034472492] [2024-11-09 06:13:29,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:29,999 INFO L87 Difference]: Start difference. First operand 1006 states and 1103 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:13:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:31,619 INFO L93 Difference]: Finished difference Result 1352 states and 1480 transitions. [2024-11-09 06:13:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 06:13:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:31,623 INFO L225 Difference]: With dead ends: 1352 [2024-11-09 06:13:31,623 INFO L226 Difference]: Without dead ends: 1352 [2024-11-09 06:13:31,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:13:31,624 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 367 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:31,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2805 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 06:13:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-09 06:13:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1008. [2024-11-09 06:13:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 568 states have (on average 1.931338028169014) internal successors, (1097), 1002 states have internal predecessors, (1097), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1105 transitions. [2024-11-09 06:13:31,646 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1105 transitions. Word has length 12 [2024-11-09 06:13:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:31,646 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1105 transitions. [2024-11-09 06:13:31,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:13:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1105 transitions. [2024-11-09 06:13:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:13:31,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:31,647 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:13:31,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:31,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:31,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:31,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash -927421553, now seen corresponding path program 1 times [2024-11-09 06:13:31,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:31,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358695089] [2024-11-09 06:13:31,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:31,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:13:31,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:31,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:31,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:32,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:13:32,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:32,054 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:13:32,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:32,054 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358695089] [2024-11-09 06:13:32,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358695089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855890987] [2024-11-09 06:13:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:32,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:32,057 INFO L87 Difference]: Start difference. First operand 1008 states and 1105 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:13:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:32,095 INFO L93 Difference]: Finished difference Result 965 states and 1060 transitions. [2024-11-09 06:13:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:32,095 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:13:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:32,099 INFO L225 Difference]: With dead ends: 965 [2024-11-09 06:13:32,099 INFO L226 Difference]: Without dead ends: 965 [2024-11-09 06:13:32,099 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:13:32,100 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 71 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1865 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:13:32,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1865 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:13:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-09 06:13:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2024-11-09 06:13:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 549 states have (on average 1.9162112932604736) internal successors, (1052), 959 states have internal predecessors, (1052), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1060 transitions. [2024-11-09 06:13:32,118 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1060 transitions. Word has length 19 [2024-11-09 06:13:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:32,118 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1060 transitions. [2024-11-09 06:13:32,118 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:13:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1060 transitions. [2024-11-09 06:13:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:13:32,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:32,119 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:13:32,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:32,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1316485504, now seen corresponding path program 1 times [2024-11-09 06:13:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:32,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809148974] [2024-11-09 06:13:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:32,321 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:13:32,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:32,322 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:32,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:13:32,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:32,533 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:13:32,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:32,534 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809148974] [2024-11-09 06:13:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809148974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908330858] [2024-11-09 06:13:32,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:32,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:32,537 INFO L87 Difference]: Start difference. First operand 965 states and 1060 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:13:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:32,669 INFO L93 Difference]: Finished difference Result 943 states and 1031 transitions. [2024-11-09 06:13:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:13:32,670 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:13:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:32,673 INFO L225 Difference]: With dead ends: 943 [2024-11-09 06:13:32,673 INFO L226 Difference]: Without dead ends: 943 [2024-11-09 06:13:32,674 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:13:32,675 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 48 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2731 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:13:32,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2731 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:13:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-09 06:13:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2024-11-09 06:13:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 541 states have (on average 1.8909426987060998) internal successors, (1023), 937 states have internal predecessors, (1023), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1031 transitions. [2024-11-09 06:13:32,698 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1031 transitions. Word has length 20 [2024-11-09 06:13:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:32,699 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1031 transitions. [2024-11-09 06:13:32,699 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:13:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1031 transitions. [2024-11-09 06:13:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:13:32,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:32,700 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:13:32,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:32,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1802854638, now seen corresponding path program 1 times [2024-11-09 06:13:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619896645] [2024-11-09 06:13:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:32,906 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:13:32,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:32,909 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:32,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:33,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:33,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:33,117 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:13:33,234 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:13:33,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:33,235 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619896645] [2024-11-09 06:13:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619896645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:33,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099832588] [2024-11-09 06:13:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:33,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:33,237 INFO L87 Difference]: Start difference. First operand 943 states and 1031 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:13:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:35,848 INFO L93 Difference]: Finished difference Result 1324 states and 1443 transitions. [2024-11-09 06:13:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:35,849 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:13:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:35,851 INFO L225 Difference]: With dead ends: 1324 [2024-11-09 06:13:35,851 INFO L226 Difference]: Without dead ends: 1324 [2024-11-09 06:13:35,851 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:13:35,852 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 864 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:35,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1191 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 06:13:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-11-09 06:13:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 939. [2024-11-09 06:13:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 541 states have (on average 1.8835489833641406) internal successors, (1019), 933 states have internal predecessors, (1019), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1027 transitions. [2024-11-09 06:13:35,870 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1027 transitions. Word has length 34 [2024-11-09 06:13:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:35,871 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1027 transitions. [2024-11-09 06:13:35,871 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:13:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1027 transitions. [2024-11-09 06:13:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:13:35,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:35,872 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:13:35,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:13:36,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:36,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:36,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1802854639, now seen corresponding path program 1 times [2024-11-09 06:13:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188064900] [2024-11-09 06:13:36,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:36,075 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:13:36,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:36,078 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:36,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:36,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:13:36,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:36,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:13:36,587 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:13:36,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:36,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188064900] [2024-11-09 06:13:36,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188064900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:36,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:36,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240441978] [2024-11-09 06:13:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:36,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:36,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:36,591 INFO L87 Difference]: Start difference. First operand 939 states and 1027 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:13:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:40,178 INFO L93 Difference]: Finished difference Result 1386 states and 1472 transitions. [2024-11-09 06:13:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:40,179 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:13:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:40,181 INFO L225 Difference]: With dead ends: 1386 [2024-11-09 06:13:40,181 INFO L226 Difference]: Without dead ends: 1386 [2024-11-09 06:13:40,181 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:13:40,182 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 625 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:40,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1551 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 06:13:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-09 06:13:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 935. [2024-11-09 06:13:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 541 states have (on average 1.8761552680221811) internal successors, (1015), 929 states have internal predecessors, (1015), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1023 transitions. [2024-11-09 06:13:40,199 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1023 transitions. Word has length 34 [2024-11-09 06:13:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:40,200 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1023 transitions. [2024-11-09 06:13:40,200 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:13:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1023 transitions. [2024-11-09 06:13:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 06:13:40,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:40,202 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] [2024-11-09 06:13:40,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:40,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:40,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:40,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2032463686, now seen corresponding path program 1 times [2024-11-09 06:13:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:40,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645172800] [2024-11-09 06:13:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:40,404 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:13:40,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:40,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:40,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:40,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:13:40,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:40,747 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:13:40,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:40,747 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645172800] [2024-11-09 06:13:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645172800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839695426] [2024-11-09 06:13:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:40,749 INFO L87 Difference]: Start difference. First operand 935 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:13:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:40,833 INFO L93 Difference]: Finished difference Result 929 states and 1013 transitions. [2024-11-09 06:13:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:13:40,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 06:13:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:40,837 INFO L225 Difference]: With dead ends: 929 [2024-11-09 06:13:40,837 INFO L226 Difference]: Without dead ends: 929 [2024-11-09 06:13:40,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:13:40,838 INFO L432 NwaCegarLoop]: 913 mSDtfsCounter, 21 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2708 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:13:40,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2708 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:13:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-09 06:13:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2024-11-09 06:13:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 535 states have (on average 1.8785046728971964) internal successors, (1005), 923 states have internal predecessors, (1005), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1013 transitions. [2024-11-09 06:13:40,853 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1013 transitions. Word has length 50 [2024-11-09 06:13:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:40,854 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1013 transitions. [2024-11-09 06:13:40,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:13:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1013 transitions. [2024-11-09 06:13:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 06:13:40,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:40,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:40,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:41,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:41,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1434396526, now seen corresponding path program 1 times [2024-11-09 06:13:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016245157] [2024-11-09 06:13:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:41,062 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:13:41,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:41,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:41,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:41,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:13:41,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:41,723 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:13:41,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:41,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:41,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016245157] [2024-11-09 06:13:41,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016245157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:41,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229280718] [2024-11-09 06:13:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:41,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:13:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:13:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:13:41,725 INFO L87 Difference]: Start difference. First operand 929 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:13:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:41,992 INFO L93 Difference]: Finished difference Result 1274 states and 1401 transitions. [2024-11-09 06:13:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:13:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-09 06:13:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:41,995 INFO L225 Difference]: With dead ends: 1274 [2024-11-09 06:13:41,996 INFO L226 Difference]: Without dead ends: 1274 [2024-11-09 06:13:41,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:13:41,996 INFO L432 NwaCegarLoop]: 1136 mSDtfsCounter, 311 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:41,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1986 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:13:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-09 06:13:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1139. [2024-11-09 06:13:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 745 states have (on average 1.8416107382550335) internal successors, (1372), 1133 states have internal predecessors, (1372), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1380 transitions. [2024-11-09 06:13:42,014 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1380 transitions. Word has length 58 [2024-11-09 06:13:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:42,015 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1380 transitions. [2024-11-09 06:13:42,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:13:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1380 transitions. [2024-11-09 06:13:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:13:42,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:42,016 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:13:42,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:42,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:42,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1584737093, now seen corresponding path program 1 times [2024-11-09 06:13:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:42,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604521665] [2024-11-09 06:13:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:42,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:13:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:42,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:42,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:42,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:13:42,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:42,575 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:13:42,597 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:13:43,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:13:43,391 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:13:43,409 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:13:43,409 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:13:43,428 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:13:43,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:43,431 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604521665] [2024-11-09 06:13:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604521665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:43,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:43,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:13:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349182502] [2024-11-09 06:13:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:43,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:43,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:43,433 INFO L87 Difference]: Start difference. First operand 1139 states and 1380 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:13:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:46,309 INFO L93 Difference]: Finished difference Result 1559 states and 1927 transitions. [2024-11-09 06:13:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:46,310 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:13:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:46,314 INFO L225 Difference]: With dead ends: 1559 [2024-11-09 06:13:46,314 INFO L226 Difference]: Without dead ends: 1559 [2024-11-09 06:13:46,314 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:13:46,315 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1998 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:46,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 480 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:13:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-11-09 06:13:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1064. [2024-11-09 06:13:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 708 states have (on average 1.7796610169491525) internal successors, (1260), 1058 states have internal predecessors, (1260), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1268 transitions. [2024-11-09 06:13:46,333 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1268 transitions. Word has length 61 [2024-11-09 06:13:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:46,333 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1268 transitions. [2024-11-09 06:13:46,333 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:13:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1268 transitions. [2024-11-09 06:13:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:13:46,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:46,335 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:13:46,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:46,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:46,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash -717148443, now seen corresponding path program 1 times [2024-11-09 06:13:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:46,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062620880] [2024-11-09 06:13:46,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:46,540 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:13:46,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:46,543 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:46,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:46,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:13:46,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:46,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:13:46,846 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:13:46,875 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:13:46,887 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:13:46,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:46,887 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062620880] [2024-11-09 06:13:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062620880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204018873] [2024-11-09 06:13:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:13:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:13:46,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:13:46,889 INFO L87 Difference]: Start difference. First operand 1064 states and 1268 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:13:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:49,449 INFO L93 Difference]: Finished difference Result 1063 states and 1267 transitions. [2024-11-09 06:13:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:13:49,452 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:13:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:49,454 INFO L225 Difference]: With dead ends: 1063 [2024-11-09 06:13:49,454 INFO L226 Difference]: Without dead ends: 1063 [2024-11-09 06:13:49,455 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:13:49,455 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 2 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:49,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2286 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 06:13:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-11-09 06:13:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2024-11-09 06:13:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 708 states have (on average 1.7782485875706215) internal successors, (1259), 1057 states have internal predecessors, (1259), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1267 transitions. [2024-11-09 06:13:49,473 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1267 transitions. Word has length 66 [2024-11-09 06:13:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:49,474 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1267 transitions. [2024-11-09 06:13:49,474 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:13:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1267 transitions. [2024-11-09 06:13:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:13:49,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:49,475 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:13:49,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:49,676 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -717148442, now seen corresponding path program 1 times [2024-11-09 06:13:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407060940] [2024-11-09 06:13:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:49,677 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:13:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:49,678 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:49,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:49,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 06:13:49,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:49,982 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:13:50,003 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:13:50,010 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:13:50,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 06:13:50,110 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:13:50,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:50,110 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407060940] [2024-11-09 06:13:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407060940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675375661] [2024-11-09 06:13:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:50,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:13:50,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:50,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:13:50,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:13:50,113 INFO L87 Difference]: Start difference. First operand 1063 states and 1267 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:13:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:53,493 INFO L93 Difference]: Finished difference Result 1062 states and 1266 transitions. [2024-11-09 06:13:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:13:53,494 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:13:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:53,496 INFO L225 Difference]: With dead ends: 1062 [2024-11-09 06:13:53,496 INFO L226 Difference]: Without dead ends: 1062 [2024-11-09 06:13:53,496 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:13:53,497 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 1 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:53,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2324 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:13:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2024-11-09 06:13:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2024-11-09 06:13:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 707 states have (on average 1.7793493635077793) internal successors, (1258), 1056 states have internal predecessors, (1258), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:13:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1266 transitions. [2024-11-09 06:13:53,512 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1266 transitions. Word has length 66 [2024-11-09 06:13:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:53,513 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1266 transitions. [2024-11-09 06:13:53,513 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:13:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1266 transitions. [2024-11-09 06:13:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 06:13:53,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:53,514 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:13:53,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:53,715 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -362420756, now seen corresponding path program 1 times [2024-11-09 06:13:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909723737] [2024-11-09 06:13:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:53,716 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:13:53,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:53,717 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:53,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:54,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:13:54,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:54,040 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:13:54,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:13:54,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909723737] [2024-11-09 06:13:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909723737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:13:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:13:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:13:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667537493] [2024-11-09 06:13:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:13:54,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:13:54,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:13:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:13:54,044 INFO L87 Difference]: Start difference. First operand 1062 states and 1266 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:13:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:54,095 INFO L93 Difference]: Finished difference Result 1065 states and 1270 transitions. [2024-11-09 06:13:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:13:54,096 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:13:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:54,101 INFO L225 Difference]: With dead ends: 1065 [2024-11-09 06:13:54,101 INFO L226 Difference]: Without dead ends: 1065 [2024-11-09 06:13:54,101 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:13:54,102 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 0 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2653 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:13:54,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2653 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:13:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-09 06:13:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2024-11-09 06:13:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 709 states have (on average 1.778561354019746) internal successors, (1261), 1059 states have internal predecessors, (1261), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:13:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1270 transitions. [2024-11-09 06:13:54,123 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1270 transitions. Word has length 74 [2024-11-09 06:13:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:54,124 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1270 transitions. [2024-11-09 06:13:54,124 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:13:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1270 transitions. [2024-11-09 06:13:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 06:13:54,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:54,125 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:13:54,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:54,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:54,326 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1604451564, now seen corresponding path program 1 times [2024-11-09 06:13:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852733704] [2024-11-09 06:13:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:54,327 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:13:54,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:54,328 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:54,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:54,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:54,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:54,730 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:13:54,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:54,824 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:13:54,824 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852733704] [2024-11-09 06:13:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852733704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [851126847] [2024-11-09 06:13:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:54,826 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:13:54,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:13:54,829 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:13:54,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-09 06:13:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:55,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:55,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:55,396 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:13:55,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:55,429 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:13:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [851126847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575627569] [2024-11-09 06:13:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:55,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:55,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:13:55,432 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:13:55,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 06:13:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:55,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:55,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:55,739 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:13:55,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:55,775 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:13:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575627569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:55,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:13:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-09 06:13:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330961516] [2024-11-09 06:13:55,776 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:13:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:13:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:13:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:13:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:13:55,778 INFO L87 Difference]: Start difference. First operand 1065 states and 1270 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:13:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:55,943 INFO L93 Difference]: Finished difference Result 1077 states and 1287 transitions. [2024-11-09 06:13:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:13:55,944 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:13:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:55,949 INFO L225 Difference]: With dead ends: 1077 [2024-11-09 06:13:55,949 INFO L226 Difference]: Without dead ends: 1077 [2024-11-09 06:13:55,949 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:13:55,950 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 8 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:55,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2655 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:13:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-09 06:13:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1075. [2024-11-09 06:13:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 718 states have (on average 1.777158774373259) internal successors, (1276), 1068 states have internal predecessors, (1276), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:13:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1285 transitions. [2024-11-09 06:13:55,972 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1285 transitions. Word has length 75 [2024-11-09 06:13:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1285 transitions. [2024-11-09 06:13:55,973 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:13:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1285 transitions. [2024-11-09 06:13:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:13:55,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:55,974 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:13:55,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-09 06:13:56,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-09 06:13:56,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:13:56,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:56,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:13:56,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1239945236, now seen corresponding path program 2 times [2024-11-09 06:13:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:13:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226354331] [2024-11-09 06:13:56,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:13:56,577 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:13:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:13:56,578 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:56,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:13:57,063 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:13:57,063 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:13:57,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:13:57,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:57,135 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:13:57,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:57,308 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:13:57,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:13:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226354331] [2024-11-09 06:13:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226354331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1300411338] [2024-11-09 06:13:57,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:13:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:13:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:13:57,310 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:13:57,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 06:13:58,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:13:58,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:13:58,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:13:58,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:58,945 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:13:58,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:59,016 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:13:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1300411338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673761851] [2024-11-09 06:13:59,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:13:59,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:59,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:13:59,019 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:13:59,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 06:14:20,449 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:14:20,449 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:14:20,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:14:20,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:20,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:14:20,652 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:14:20,697 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:14:21,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:14:21,034 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:14:21,102 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:14:21,141 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:14:21,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:21,277 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:14:21,278 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:14:21,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem34#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1624) |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:14:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673761851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:14:21,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:14:21,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-09 06:14:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740512973] [2024-11-09 06:14:21,293 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:14:21,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:14:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:14:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:14:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2024-11-09 06:14:21,295 INFO L87 Difference]: Start difference. First operand 1075 states and 1285 transitions. Second operand has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 22 states have internal predecessors, (150), 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:14:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:14:33,165 INFO L93 Difference]: Finished difference Result 1549 states and 1893 transitions. [2024-11-09 06:14:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 06:14:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 22 states have internal predecessors, (150), 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:14:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:14:33,170 INFO L225 Difference]: With dead ends: 1549 [2024-11-09 06:14:33,171 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 06:14:33,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2024-11-09 06:14:33,171 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 807 mSDsluCounter, 6438 mSDsCounter, 0 mSdLazyCounter, 6331 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 6925 SdHoareTripleChecker+Invalid, 6358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 6331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:14:33,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 6925 Invalid, 6358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 6331 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-09 06:14:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 06:14:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1083. [2024-11-09 06:14:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 727 states have (on average 1.7702888583218708) internal successors, (1287), 1076 states have internal predecessors, (1287), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:14:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1296 transitions. [2024-11-09 06:14:33,190 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1296 transitions. Word has length 78 [2024-11-09 06:14:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:14:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1296 transitions. [2024-11-09 06:14:33,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 22 states have internal predecessors, (150), 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:14:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1296 transitions. [2024-11-09 06:14:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 06:14:33,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:14:33,192 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:14:33,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 06:14:33,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-09 06:14:33,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:14:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:14:33,793 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:14:33,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:14:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash 222535405, now seen corresponding path program 1 times [2024-11-09 06:14:33,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:14:33,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645259401] [2024-11-09 06:14:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:14:33,794 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:14:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:14:33,797 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:14:33,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:14:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:14:34,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:14:34,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:34,303 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:14:34,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:34,882 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:14:34,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:14:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645259401] [2024-11-09 06:14:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645259401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [653076938] [2024-11-09 06:14:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:14:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:14:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:14:34,886 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:14:34,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 06:14:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:14:35,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:14:35,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:35,597 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:14:35,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:35,746 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:14:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [653076938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:35,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309951292] [2024-11-09 06:14:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:14:35,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:14:35,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:14:35,749 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:14:35,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 06:14:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:14:36,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:14:36,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:36,207 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:14:36,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:36,991 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:14:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309951292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:36,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:14:36,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-09 06:14:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905723747] [2024-11-09 06:14:36,992 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:14:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:14:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:14:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:14:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 06:14:36,994 INFO L87 Difference]: Start difference. First operand 1083 states and 1296 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:14:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:14:39,136 INFO L93 Difference]: Finished difference Result 1109 states and 1337 transitions. [2024-11-09 06:14:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 06:14:39,137 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:14:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:14:39,141 INFO L225 Difference]: With dead ends: 1109 [2024-11-09 06:14:39,141 INFO L226 Difference]: Without dead ends: 1103 [2024-11-09 06:14:39,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 06:14:39,143 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 26 mSDsluCounter, 10599 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11485 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:14:39,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 11485 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:14:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-09 06:14:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1101. [2024-11-09 06:14:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 745 states have (on average 1.7583892617449663) internal successors, (1310), 1094 states have internal predecessors, (1310), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:14:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1319 transitions. [2024-11-09 06:14:39,163 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1319 transitions. Word has length 84 [2024-11-09 06:14:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:14:39,163 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1319 transitions. [2024-11-09 06:14:39,163 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:14:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1319 transitions. [2024-11-09 06:14:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 06:14:39,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:14:39,178 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:14:39,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Ended with exit code 0 [2024-11-09 06:14:39,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-09 06:14:39,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-09 06:14:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:14:39,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:14:39,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:14:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash -87212819, now seen corresponding path program 2 times [2024-11-09 06:14:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:14:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316496402] [2024-11-09 06:14:39,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:14:39,780 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:14:39,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:14:39,781 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:14:39,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:14:40,366 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:14:40,366 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:14:40,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:14:40,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:40,880 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:14:40,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:42,792 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:14:42,793 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:14:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316496402] [2024-11-09 06:14:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316496402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [421918663] [2024-11-09 06:14:42,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:14:42,794 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:14:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:14:42,796 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:14:42,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 06:14:44,559 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:14:44,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:14:44,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:14:44,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:44,680 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:14:44,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:45,054 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:14:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [421918663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226377367] [2024-11-09 06:14:45,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:14:45,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:14:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:14:45,055 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:14:45,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 06:15:15,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:15:15,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:15:15,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 06:15:15,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:15:15,150 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:15:15,376 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:15:15,394 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:15:15,394 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:15:15,503 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:15:15,510 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:15:15,853 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:15:15,861 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:15:16,600 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:15:16,600 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:15:16,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:15:16,826 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:15:16,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:15:16,936 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:15:16,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:15:18,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2925) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2926) |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:15:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226377367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:15:18,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:15:18,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-09 06:15:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308224756] [2024-11-09 06:15:18,094 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:15:18,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 06:15:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:15:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 06:15:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-09 06:15:18,097 INFO L87 Difference]: Start difference. First operand 1101 states and 1319 transitions. Second operand has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 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:16:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:16:01,700 INFO L93 Difference]: Finished difference Result 1602 states and 1977 transitions. [2024-11-09 06:16:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-09 06:16:01,701 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 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:16:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:16:01,705 INFO L225 Difference]: With dead ends: 1602 [2024-11-09 06:16:01,705 INFO L226 Difference]: Without dead ends: 1594 [2024-11-09 06:16:01,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3100, Invalid=14459, Unknown=1, NotChecked=262, Total=17822 [2024-11-09 06:16:01,709 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 824 mSDsluCounter, 15187 mSDsCounter, 0 mSdLazyCounter, 17512 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 15676 SdHoareTripleChecker+Invalid, 17566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 17512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:16:01,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 15676 Invalid, 17566 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [54 Valid, 17512 Invalid, 0 Unknown, 0 Unchecked, 33.7s Time] [2024-11-09 06:16:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-11-09 06:16:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1134. [2024-11-09 06:16:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 779 states have (on average 1.7342747111681642) internal successors, (1351), 1127 states have internal predecessors, (1351), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:16:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1360 transitions. [2024-11-09 06:16:01,728 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1360 transitions. Word has length 96 [2024-11-09 06:16:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:16:01,729 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1360 transitions. [2024-11-09 06:16:01,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 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:16:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1360 transitions. [2024-11-09 06:16:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:16:01,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:16:01,731 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:16:01,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:01,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:02,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:16:02,332 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:16:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:16:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1317117058, now seen corresponding path program 1 times [2024-11-09 06:16:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:16:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954820965] [2024-11-09 06:16:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:02,333 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:16:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:16:02,335 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:16:02,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:16:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:03,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 06:16:03,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:03,139 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:16:03,273 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:16:03,274 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:16:03,301 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:16:03,416 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:16:04,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:04,481 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:16:04,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:04,586 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:16:04,620 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:16:04,653 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:16:04,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:04,703 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3349) |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:16:04,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3349 (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_3349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:16:05,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3395 (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~mem34#1.base| v_ArrVal_3395))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3349)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:16:05,111 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:16:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954820965] [2024-11-09 06:16:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954820965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [864639210] [2024-11-09 06:16:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:05,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:16:05,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:16:05,113 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:16:05,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 06:16:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:08,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 06:16:08,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:08,403 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:16:08,547 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:16:08,548 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:16:08,570 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:16:08,646 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:16:09,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:09,694 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:16:09,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:09,794 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:16:09,847 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:16:09,858 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:16:09,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:09,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3818) |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:16:09,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3818 (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_3818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:16:10,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3818 (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~mem34#1.base| v_ArrVal_3864))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:16:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [864639210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958695833] [2024-11-09 06:16:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:10,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:16:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:16:10,316 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:16:10,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 06:16:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:10,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 06:16:10,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:11,101 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:16:11,101 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:16:11,127 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:16:11,845 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:11,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:16:11,985 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:11,986 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:16:12,006 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:16:12,011 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:16:12,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:12,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4285 (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_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:16:12,624 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 06:16:12,624 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:16:12,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem34#1.base| (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~mem34#1.base| v_ArrVal_4331))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4285)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 06:16:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958695833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:12,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:16:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-09 06:16:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404788668] [2024-11-09 06:16:12,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:16:12,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 06:16:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:16:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 06:16:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=350, Unknown=16, NotChecked=360, Total=812 [2024-11-09 06:16:12,639 INFO L87 Difference]: Start difference. First operand 1134 states and 1360 transitions. Second operand has 19 states, 16 states have (on average 6.1875) internal successors, (99), 18 states have internal predecessors, (99), 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:16:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:16:22,732 INFO L93 Difference]: Finished difference Result 1593 states and 1946 transitions. [2024-11-09 06:16:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:16:22,733 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.1875) internal successors, (99), 18 states have internal predecessors, (99), 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:16:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:16:22,738 INFO L225 Difference]: With dead ends: 1593 [2024-11-09 06:16:22,738 INFO L226 Difference]: Without dead ends: 1593 [2024-11-09 06:16:22,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 351 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=461, Unknown=16, NotChecked=408, Total=992 [2024-11-09 06:16:22,739 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 779 mSDsluCounter, 5354 mSDsCounter, 0 mSdLazyCounter, 5340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 5840 SdHoareTripleChecker+Invalid, 5350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 5340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:16:22,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 5840 Invalid, 5350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 5340 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2024-11-09 06:16:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2024-11-09 06:16:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1133. [2024-11-09 06:16:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 779 states have (on average 1.7329910141206675) internal successors, (1350), 1126 states have internal predecessors, (1350), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:16:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1359 transitions. [2024-11-09 06:16:22,757 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1359 transitions. Word has length 121 [2024-11-09 06:16:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:16:22,757 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1359 transitions. [2024-11-09 06:16:22,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.1875) internal successors, (99), 18 states have internal predecessors, (99), 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:16:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1359 transitions. [2024-11-09 06:16:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:16:22,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:16:22,759 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:16:22,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:22,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:23,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-09 06:16:23,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:16:23,360 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:16:23,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:16:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1317117059, now seen corresponding path program 1 times [2024-11-09 06:16:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:16:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601804945] [2024-11-09 06:16:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:23,362 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:16:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:16:23,363 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:16:23,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:16:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:16:24,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 06:16:24,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:16:24,361 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:16:24,492 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:16:24,511 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:16:24,512 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:16:24,540 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:16:24,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 06:16:24,681 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:16:24,686 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:16:25,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:25,530 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:16:25,537 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:16:25,669 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:16:25,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:16:25,676 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:16:25,711 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:16:25,720 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:16:25,753 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:16:25,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:16:25,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:16:25,916 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_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-09 06:16:27,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4892) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4891))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4892) .cse2 v_ArrVal_4800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:16:27,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:16:27,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601804945] [2024-11-09 06:16:27,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601804945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:16:27,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [61605602] [2024-11-09 06:16:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:16:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:16:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:16:27,423 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:16:27,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-09 06:17:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:55,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 06:17:55,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:55,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:17:55,353 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:17:55,353 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:17:55,361 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:17:55,374 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:17:55,380 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:17:55,451 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:17:55,456 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:17:56,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:17:56,274 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:17:56,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:17:56,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:17:56,352 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:17:56,358 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:17:56,386 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:17:56,393 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:17:56,397 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:17:56,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:17:56,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5360) |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_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 06:17:56,472 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_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5360) |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:17:57,824 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5453))) (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~mem34#1.base| v_ArrVal_5452) .cse0 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5452) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5360) |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:17:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [61605602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:17:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067293082] [2024-11-09 06:17:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:57,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:17:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:17:57,834 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:17:57,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 06:17:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:58,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-09 06:17:58,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:58,718 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:17:58,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:17:58,726 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:17:58,735 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:17:58,744 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:17:58,812 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:17:58,816 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:17:59,605 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:17:59,605 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:17:59,612 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:17:59,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:17:59,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:17:59,689 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:17:59,723 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:17:59,733 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:17:59,738 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:17:59,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:17:59,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-09 06:17:59,852 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_5920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5921) |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:18:01,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6013) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6012))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6013) .cse2 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:18:01,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067293082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:01,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:18:01,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-09 06:18:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066903400] [2024-11-09 06:18:01,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:18:01,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:18:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:18:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=113, Unknown=9, NotChecked=252, Total=420 [2024-11-09 06:18:01,397 INFO L87 Difference]: Start difference. First operand 1133 states and 1359 transitions. Second operand has 10 states, 8 states have (on average 10.125) internal successors, (81), 10 states have internal predecessors, (81), 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:18:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:08,562 INFO L93 Difference]: Finished difference Result 1590 states and 1943 transitions. [2024-11-09 06:18:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:18:08,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 10.125) internal successors, (81), 10 states have internal predecessors, (81), 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:18:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:08,574 INFO L225 Difference]: With dead ends: 1590 [2024-11-09 06:18:08,575 INFO L226 Difference]: Without dead ends: 1590 [2024-11-09 06:18:08,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 357 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=222, Unknown=9, NotChecked=342, Total=650 [2024-11-09 06:18:08,576 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 784 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:08,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1960 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2973 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-09 06:18:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-09 06:18:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1132. [2024-11-09 06:18:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 779 states have (on average 1.7317073170731707) internal successors, (1349), 1125 states have internal predecessors, (1349), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:18:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1358 transitions. [2024-11-09 06:18:08,596 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1358 transitions. Word has length 121 [2024-11-09 06:18:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:08,597 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1358 transitions. [2024-11-09 06:18:08,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 10.125) internal successors, (81), 10 states have internal predecessors, (81), 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:18:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1358 transitions. [2024-11-09 06:18:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:18:08,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:08,598 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:18:08,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:08,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:09,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:09,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:09,199 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:18:09,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -586637485, now seen corresponding path program 1 times [2024-11-09 06:18:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854559678] [2024-11-09 06:18:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:09,201 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:18:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:09,204 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:09,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:10,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:18:10,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:10,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:18:10,548 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:18:10,548 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:18:10,574 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:18:10,701 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:18:11,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:11,657 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:18:11,778 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:11,778 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:18:11,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:11,867 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:18:11,892 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:18:11,927 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:18:11,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:11,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6452) |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:18:11,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6452 (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_6452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:18:12,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6452 (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_6451))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6452)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:18:12,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6452 (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_6451))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6452)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:18:12,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6498 (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~mem34#1.base| v_ArrVal_6498))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6451)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6452)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:18:12,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854559678] [2024-11-09 06:18:12,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854559678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649877466] [2024-11-09 06:18:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:12,453 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:18:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:18:12,456 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:18:12,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-09 06:18:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:34,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 06:18:34,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:34,492 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:18:34,629 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:18:34,629 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:18:34,651 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:18:34,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 06:18:35,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:35,693 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:18:35,788 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:35,789 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:18:35,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:35,864 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:18:35,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 06:18:35,909 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:18:35,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:36,002 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-09 06:18:36,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6937 (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_6936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:18:36,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6937 (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_6936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:18:36,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6983 (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~mem34#1.base| v_ArrVal_6983))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:18:36,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [649877466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:36,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093268772] [2024-11-09 06:18:36,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:36,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:36,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:18:36,457 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:36,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-09 06:18:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:37,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 06:18:37,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:37,379 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:18:37,379 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:18:37,407 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:18:37,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:37,785 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:18:37,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:37,885 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:18:38,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:38,033 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:18:38,048 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:18:38,052 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:18:38,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:38,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7420) |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:18:38,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7420 (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_7420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:18:38,114 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 06:18:38,115 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:18:38,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (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_7419))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7420)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 06:18:38,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7419))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7420)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 06:18:38,557 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7466 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7466)) (.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_7419))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7420)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 06:18:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093268772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:38,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:18:38,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-09 06:18:38,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396447431] [2024-11-09 06:18:38,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:18:38,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:18:38,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:38,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:18:38,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=388, Unknown=22, NotChecked=742, Total=1260 [2024-11-09 06:18:38,562 INFO L87 Difference]: Start difference. First operand 1132 states and 1358 transitions. Second operand has 20 states, 17 states have (on average 6.176470588235294) internal successors, (105), 20 states have internal predecessors, (105), 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:18:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:47,611 INFO L93 Difference]: Finished difference Result 1591 states and 1944 transitions. [2024-11-09 06:18:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:18:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.176470588235294) internal successors, (105), 20 states have internal predecessors, (105), 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:18:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:47,616 INFO L225 Difference]: With dead ends: 1591 [2024-11-09 06:18:47,617 INFO L226 Difference]: Without dead ends: 1591 [2024-11-09 06:18:47,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=422, Unknown=23, NotChecked=770, Total=1332 [2024-11-09 06:18:47,618 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 774 mSDsluCounter, 3996 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 4483 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 4483 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-09 06:18:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-11-09 06:18:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1131. [2024-11-09 06:18:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 779 states have (on average 1.730423620025674) internal successors, (1348), 1124 states have internal predecessors, (1348), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:18:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1357 transitions. [2024-11-09 06:18:47,635 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1357 transitions. Word has length 124 [2024-11-09 06:18:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:47,635 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1357 transitions. [2024-11-09 06:18:47,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.176470588235294) internal successors, (105), 20 states have internal predecessors, (105), 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:18:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1357 transitions. [2024-11-09 06:18:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:18:47,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:47,636 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:18:47,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:47,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:48,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:48,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:48,237 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:18:48,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -586637484, now seen corresponding path program 1 times [2024-11-09 06:18:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516542749] [2024-11-09 06:18:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:48,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:18:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:48,243 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:48,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:18:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:49,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 06:18:49,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:49,383 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:18:49,509 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:18:49,522 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:18:49,522 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:18:49,546 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:18:49,550 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:18:49,659 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:18:49,664 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:18:50,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:50,408 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:18:50,420 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:18:50,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:50,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:18:50,539 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:18:50,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:18:50,634 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:18:50,639 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:18:50,669 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:18:50,674 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:18:50,702 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:18:50,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:50,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7951) |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~mem37#1.base| v_ArrVal_7952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7951) |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:18:50,859 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_7951 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:18:50,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7950) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7949))) (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~mem36#1.base| v_ArrVal_7950) .cse2 v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:18:50,966 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_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7950) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7949))) (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_7950) .cse3 v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:18:52,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8043))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7949))) (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~mem34#1.base| v_ArrVal_8044) .cse0 v_ArrVal_7950) .cse1 v_ArrVal_7951) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8043))) (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~mem34#1.base| v_ArrVal_8044) .cse6 v_ArrVal_7950) (select (select (store .cse7 .cse6 v_ArrVal_7949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7951))) |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:18:52,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516542749] [2024-11-09 06:18:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516542749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412871526] [2024-11-09 06:18:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:52,782 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:18:52,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:18:52,783 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:18:52,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-09 06:19:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:43,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-09 06:19:43,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:43,031 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:19:43,330 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:19:43,361 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:19:43,361 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:19:43,384 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:19:43,392 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:19:43,519 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:19:43,530 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:19:44,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:44,929 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:19:44,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:19:45,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:45,085 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:19:45,096 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:19:45,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:45,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:19:45,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:19:45,280 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:19:45,287 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:19:45,294 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:19:45,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:45,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8530) |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~mem37#1.base| v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8530) |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:19:45,429 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_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8530) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8530) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:19:45,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8528) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8530) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8527))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8528) .cse2 v_ArrVal_8530) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:19:49,158 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8621))) (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~mem34#1.base| v_ArrVal_8622) .cse1 v_ArrVal_8528) (select (select (store .cse2 .cse1 v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8530))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8530 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8621))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8527))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8622) .cse4 v_ArrVal_8528) .cse5 v_ArrVal_8530) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 06:19:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1412871526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:19:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317685468] [2024-11-09 06:19:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:49,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:49,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:49,186 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:19:49,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-09 06:19:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:50,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-09 06:19:50,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:50,210 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:19:50,635 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:19:50,683 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:19:50,683 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:19:50,704 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:19:50,714 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:19:50,873 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:19:50,883 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:19:52,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:52,885 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:19:52,900 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:19:53,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:53,149 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:19:53,178 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:19:53,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:53,302 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:19:53,313 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:19:53,385 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:19:53,396 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:19:53,405 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:19:53,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:53,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9107) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9107) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:19:53,556 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_9108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9107) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9107) |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:19:53,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9105 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9105))) (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~mem36#1.base| v_ArrVal_9106) .cse0 v_ArrVal_9107) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9105 (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_9106) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9105) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9107) |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:19:57,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9105 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9199))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9105))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9200) .cse0 v_ArrVal_9106) .cse1 v_ArrVal_9107) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9105 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9199))) (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~mem34#1.base| v_ArrVal_9200) .cse6 v_ArrVal_9106) (select (select (store .cse7 .cse6 v_ArrVal_9105) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9107))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-09 06:19:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317685468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:19:57,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:19:57,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-09 06:19:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450024472] [2024-11-09 06:19:57,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:19:57,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:19:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:19:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=166, Unknown=26, NotChecked=494, Total=756 [2024-11-09 06:19:57,212 INFO L87 Difference]: Start difference. First operand 1131 states and 1357 transitions. Second operand has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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:20:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:18,965 INFO L93 Difference]: Finished difference Result 1588 states and 1941 transitions. [2024-11-09 06:20:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:20:18,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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:20:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:18,970 INFO L225 Difference]: With dead ends: 1588 [2024-11-09 06:20:18,970 INFO L226 Difference]: Without dead ends: 1588 [2024-11-09 06:20:18,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 368 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=118, Invalid=328, Unknown=26, NotChecked=650, Total=1122 [2024-11-09 06:20:18,972 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 782 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:18,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 2568 Invalid, 4145 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 4139 Invalid, 0 Unknown, 0 Unchecked, 21.0s Time] [2024-11-09 06:20:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-09 06:20:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1130. [2024-11-09 06:20:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 779 states have (on average 1.7291399229781772) internal successors, (1347), 1123 states have internal predecessors, (1347), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:20:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1356 transitions. [2024-11-09 06:20:18,994 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1356 transitions. Word has length 124 [2024-11-09 06:20:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:18,995 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1356 transitions. [2024-11-09 06:20:18,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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:20:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1356 transitions. [2024-11-09 06:20:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:20:18,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:18,996 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:20:19,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:19,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:19,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:19,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:19,598 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:20:19,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -295077367, now seen corresponding path program 1 times [2024-11-09 06:20:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:19,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803952508] [2024-11-09 06:20:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:19,599 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:20:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:19,600 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:20:19,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:20:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:21,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 06:20:21,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:21,072 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:20:21,611 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:20:21,611 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:20:21,691 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:20:21,948 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:20:24,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:24,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 44 treesize of output 43 [2024-11-09 06:20:24,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:24,530 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:20:24,768 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:24,769 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:20:25,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:25,014 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:20:25,078 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:20:25,189 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:20:25,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:25,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9655 (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_9655) |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:20:25,392 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9655 (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_9655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:20:25,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9654 (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~mem37#1.base| v_ArrVal_9654))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9655)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:25,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9654 (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_9654))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9655)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:25,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9653 (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~mem36#1.base| v_ArrVal_9653))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9654)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9655)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:20:25,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9653 (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_9653))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9654)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9655)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:26,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9653 (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~mem34#1.base| v_ArrVal_9701))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9653)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9654)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9655)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:26,323 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803952508] [2024-11-09 06:20:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803952508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2127312362] [2024-11-09 06:20:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:26,324 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:20:26,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:20:26,325 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:20:26,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2024-11-09 06:21:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:33,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 06:21:33,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:33,522 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:21:33,992 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:21:33,992 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:21:34,029 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:21:34,179 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:21:36,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:36,262 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:21:36,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:36,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:21:36,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:36,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:21:36,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:36,693 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:21:36,755 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:21:36,779 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:21:36,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:36,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10156 (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_10156) |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:21:36,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10156 (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_10156) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:21:36,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10156 (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~mem37#1.base| v_ArrVal_10155))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10156)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:21:36,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10155))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10156)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:21:36,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10156 (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_10154))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10155)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10156)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:21:36,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10156 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10154))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10155)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10156)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:21:37,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10156 (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~mem34#1.base| v_ArrVal_10202))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10154)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10155)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10156)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:21:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2127312362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066527508] [2024-11-09 06:21:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:37,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:37,728 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:21:37,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-09 06:21:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:38,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:21:38,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:39,169 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:21:39,170 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:21:39,256 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:21:40,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:40,230 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:21:40,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:40,414 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:21:40,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:40,621 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:21:40,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:40,806 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:21:40,982 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:21:40,991 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:21:40,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:41,054 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:21:41,055 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:21:41,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10655) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2024-11-09 06:21:41,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10655 (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_10655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 06:21:41,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10654)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 06:21:41,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10655 (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_10654))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:21:41,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10653))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10654)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:21:41,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10653))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10654)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:21:41,970 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10701))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10653)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10654)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:21:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066527508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:41,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:21:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2024-11-09 06:21:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881215873] [2024-11-09 06:21:41,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:21:41,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:21:41,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:21:41,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:21:41,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=442, Unknown=21, NotChecked=1302, Total=1892 [2024-11-09 06:21:41,978 INFO L87 Difference]: Start difference. First operand 1130 states and 1356 transitions. Second operand has 22 states, 19 states have (on average 5.842105263157895) internal successors, (111), 22 states have internal predecessors, (111), 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:22:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:07,689 INFO L93 Difference]: Finished difference Result 1589 states and 1942 transitions. [2024-11-09 06:22:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:22:07,689 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.842105263157895) internal successors, (111), 22 states have internal predecessors, (111), 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:22:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:07,692 INFO L225 Difference]: With dead ends: 1589 [2024-11-09 06:22:07,692 INFO L226 Difference]: Without dead ends: 1589 [2024-11-09 06:22:07,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=136, Invalid=479, Unknown=21, NotChecked=1344, Total=1980 [2024-11-09 06:22:07,694 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 775 mSDsluCounter, 5370 mSDsCounter, 0 mSdLazyCounter, 5316 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 5856 SdHoareTripleChecker+Invalid, 5330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:07,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 5856 Invalid, 5330 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 5316 Invalid, 0 Unknown, 0 Unchecked, 25.4s Time] [2024-11-09 06:22:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-09 06:22:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1129. [2024-11-09 06:22:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 779 states have (on average 1.7278562259306804) internal successors, (1346), 1122 states have internal predecessors, (1346), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:22:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1355 transitions. [2024-11-09 06:22:07,712 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1355 transitions. Word has length 127 [2024-11-09 06:22:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:07,712 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1355 transitions. [2024-11-09 06:22:07,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.842105263157895) internal successors, (111), 22 states have internal predecessors, (111), 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:22:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1355 transitions. [2024-11-09 06:22:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:22:07,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:07,714 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:22:07,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:22:07,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:08,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:08,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:08,315 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:22:08,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash -295077366, now seen corresponding path program 1 times [2024-11-09 06:22:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:22:08,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096414748] [2024-11-09 06:22:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:08,316 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:22:08,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:22:08,318 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:22:08,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:22:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:09,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 06:22:09,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:09,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:22:10,323 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:22:10,370 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:22:10,370 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:22:10,428 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:22:10,438 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:22:10,711 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:22:10,721 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:22:12,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:12,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:22:12,513 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:22:12,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:12,774 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:22:12,785 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:22:13,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:13,024 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:22:13,035 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:22:13,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:13,336 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:22:13,351 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:22:13,446 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:22:13,460 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:22:13,582 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:22:13,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:13,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11204) |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_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:22:13,982 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_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-09 06:22:14,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11202) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11201))) (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~mem37#1.base| v_ArrVal_11202) .cse2 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:22:14,186 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_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11201))) (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_11202) .cse1 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11202) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11204) |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:22:14,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11199))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11201))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11200) .cse0 v_ArrVal_11202) .cse1 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (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_11199))) (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_11200) .cse6 v_ArrVal_11202) (select (select (store .cse7 .cse6 v_ArrVal_11201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11204))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-09 06:22:14,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_11199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11199))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11201))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11200) .cse1 v_ArrVal_11202) .cse2 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_11199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11199))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11200) .cse7 v_ArrVal_11202) (select (select (store .cse8 .cse7 v_ArrVal_11201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11204))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-09 06:22:19,442 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11295))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_11199))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11296) .cse1 v_ArrVal_11200) .cse2 v_ArrVal_11202) (select (select (store .cse3 .cse2 v_ArrVal_11201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11204))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11199 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11295))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_11199))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_11201))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11296) .cse6 v_ArrVal_11200) .cse7 v_ArrVal_11202) .cse8 v_ArrVal_11204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_11203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-09 06:22:19,489 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:22:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096414748] [2024-11-09 06:22:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096414748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:19,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815758267] [2024-11-09 06:22:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:19,490 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:22:19,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:22:19,491 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:22:19,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2024-11-09 06:23:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:19,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 06:23:19,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:19,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:23:22,489 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:23:22,490 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:23:22,705 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:23:22,848 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:23:23,003 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:23:23,997 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:23:24,061 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:23:36,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:36,288 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:23:36,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:23:37,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:37,539 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:23:37,631 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:23:38,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:38,628 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:23:38,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:23:39,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:39,675 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:23:39,738 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:23:40,172 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:23:40,236 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:23:40,359 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:23:40,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:23:40,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2024-11-09 06:23:41,185 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_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:23:41,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11797) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11796))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11797) .cse2 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:23:41,931 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_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11797) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11796))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11797) .cse3 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:23:42,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11794))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11796))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11795) .cse0 v_ArrVal_11797) .cse1 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (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_11794))) (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_11795) .cse6 v_ArrVal_11797) (select (select (store .cse7 .cse6 v_ArrVal_11796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11799))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-09 06:23:43,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11794))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11796))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11795) .cse1 v_ArrVal_11797) .cse2 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11794))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11795) .cse7 v_ArrVal_11797) (select (select (store .cse8 .cse7 v_ArrVal_11796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11799))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-09 06:23:50,834 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 06:23:54,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11890))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11794))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11796))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11891) .cse0 v_ArrVal_11795) .cse1 v_ArrVal_11797) .cse2 v_ArrVal_11799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11890))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11794))) (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~mem34#1.base| v_ArrVal_11891) .cse8 v_ArrVal_11795) .cse9 v_ArrVal_11797) (select (select (store .cse10 .cse9 v_ArrVal_11796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11799))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-09 06:23:54,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [815758267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:54,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611834901] [2024-11-09 06:23:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:54,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:23:54,195 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:23:54,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-09 06:23:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:55,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 06:23:55,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:55,619 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:23:59,356 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:23:59,654 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:23:59,655 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:23:59,783 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:23:59,894 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:24:00,847 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:24:00,904 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:24:12,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:12,606 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:24:12,686 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:24:13,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:13,885 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:24:13,943 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:24:14,817 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:14,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 62 treesize of output 57 [2024-11-09 06:24:14,872 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:24:15,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:15,701 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:24:15,755 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:24:16,135 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:24:16,192 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:24:16,305 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:24:16,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:16,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12394) |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:24:17,054 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_12393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-09 06:24:17,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_12391))) (let ((.cse0 (select (select .cse2 |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~mem37#1.base| v_ArrVal_12392) .cse0 v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_12393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_12392) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_12391) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-09 06:24:17,599 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_12393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12391))) (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_12392) .cse1 v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12392) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12391) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12394) |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:24:23,423 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_12389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12389))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12390) .cse2 v_ArrVal_12392) (select (select (store .cse3 .cse2 v_ArrVal_12391) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12394))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_12389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12389))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_12391))) (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_12390) .cse5 v_ArrVal_12392) .cse6 v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_12393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 06:24:29,822 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 06:24:31,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_12486))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12389))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12391))) (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~mem34#1.base| v_ArrVal_12485) .cse0 v_ArrVal_12390) .cse1 v_ArrVal_12392) .cse2 v_ArrVal_12394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_12486))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12389))) (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~mem34#1.base| v_ArrVal_12485) .cse8 v_ArrVal_12390) .cse9 v_ArrVal_12392) (select (select (store .cse10 .cse9 v_ArrVal_12391) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12394))))) |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:24:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611834901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:31,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:24:31,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2024-11-09 06:24:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678431509] [2024-11-09 06:24:31,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:31,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:24:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:24:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:24:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=185, Unknown=26, NotChecked=900, Total=1190 [2024-11-09 06:24:31,834 INFO L87 Difference]: Start difference. First operand 1129 states and 1355 transitions. Second operand has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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:27:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:11,186 INFO L93 Difference]: Finished difference Result 1586 states and 1939 transitions. [2024-11-09 06:27:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:27:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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 127 [2024-11-09 06:27:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:11,190 INFO L225 Difference]: With dead ends: 1586 [2024-11-09 06:27:11,190 INFO L226 Difference]: Without dead ends: 1586 [2024-11-09 06:27:11,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 379 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=125, Invalid=391, Unknown=26, NotChecked=1180, Total=1722 [2024-11-09 06:27:11,191 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 780 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 5291 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 152.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 5297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 154.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:11,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 3169 Invalid, 5297 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 5291 Invalid, 0 Unknown, 0 Unchecked, 154.7s Time] [2024-11-09 06:27:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-09 06:27:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1128. [2024-11-09 06:27:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 779 states have (on average 1.7265725288831835) internal successors, (1345), 1121 states have internal predecessors, (1345), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:27:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1354 transitions. [2024-11-09 06:27:11,212 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1354 transitions. Word has length 127 [2024-11-09 06:27:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:11,213 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1354 transitions. [2024-11-09 06:27:11,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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:27:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1354 transitions. [2024-11-09 06:27:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 06:27:11,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:11,214 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, 1, 1, 1, 1] [2024-11-09 06:27:11,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2024-11-09 06:27:11,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-11-09 06:27:11,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:27:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:27:11,815 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-09 06:27:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1244766667, now seen corresponding path program 1 times [2024-11-09 06:27:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:27:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395886018] [2024-11-09 06:27:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:11,817 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:27:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:27:11,818 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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:27:11,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b789499f-25e4-4746-a7ea-e7642c48521a/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 (48)] Waiting until timeout for monitored process [2024-11-09 06:27:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:13,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 06:27:13,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:13,908 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:27:17,991 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:27:17,991 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:27:18,453 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:27:20,168 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:27:33,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:33,638 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:27:35,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:35,435 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:27:37,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:37,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:27:38,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:38,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:27:40,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:40,755 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:27:41,142 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:27:42,535 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-09 06:27:42,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2024-11-09 06:27:43,261 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:27:43,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:46,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12959 (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_12959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:27:46,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12959 (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_12958))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12959)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:46,601 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12959 (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_12958))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12959)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:46,793 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12959 (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~mem37#1.base| v_ArrVal_12957))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12958)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12959)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:46,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12959 (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_12957))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12958)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12959)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:47,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12956 (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_12956))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12957)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12958)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12959)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:47,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12956 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12956))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12957)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12958)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12959)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false