./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:17:31,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:17:31,686 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:17:31,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:17:31,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:17:31,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:17:31,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:17:31,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:17:31,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:17:31,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:17:31,741 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:17:31,741 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:17:31,742 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:17:31,742 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:17:31,742 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:17:31,743 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:17:31,743 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:17:31,743 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:17:31,744 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:17:31,744 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:17:31,747 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:17:31,750 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:17:31,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:17:31,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:17:31,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:17:31,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:17:31,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:17:31,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:17:31,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:17:31,753 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:17:31,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:17:31,754 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:17:31,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:17:31,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:17:31,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:17:31,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:17:31,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:17:31,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:17:31,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:17:31,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:17:31,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:17:31,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:17:31,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:17:31,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:17:31,759 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:17:31,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:17:31,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:17:31,760 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:17:31,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:17:31,761 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_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 -> d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d [2024-11-09 06:17:32,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:17:32,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:17:32,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:17:32,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:17:32,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:17:32,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i Unable to find full path for "g++" [2024-11-09 06:17:34,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:17:34,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:17:34,445 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2024-11-09 06:17:34,460 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data/afd2fd728/12fc4c878a2e44c8969beaf60c16f8e0/FLAGf58109d2e [2024-11-09 06:17:34,693 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data/afd2fd728/12fc4c878a2e44c8969beaf60c16f8e0 [2024-11-09 06:17:34,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:17:34,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:17:34,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:17:34,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:17:34,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:17:34,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:17:34" (1/1) ... [2024-11-09 06:17:34,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5ab4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:34, skipping insertion in model container [2024-11-09 06:17:34,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:17:34" (1/1) ... [2024-11-09 06:17:34,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:17:35,366 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:17:35,415 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:17:35,419 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:17:35,424 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:17:35,431 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:17:35,471 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:17:35,472 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:17:35,475 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:17:35,475 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:17:35,479 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:17:35,481 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:17:35,482 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:17:35,483 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:17:35,488 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:17:35,489 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:17:35,492 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:17:35,493 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:17:35,495 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:17:35,496 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:17:35,500 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:17:35,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:17:35,520 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:17:35,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@13b67810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:35, skipping insertion in model container [2024-11-09 06:17:35,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:17:35,522 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 06:17:35,524 INFO L158 Benchmark]: Toolchain (without parser) took 825.80ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 65.0MB in the beginning and 117.4MB in the end (delta: -52.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-09 06:17:35,524 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:17:35,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 822.74ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 64.7MB in the beginning and 117.4MB in the end (delta: -52.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-09 06:17:35,527 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.24ms. Allocated memory is still 123.7MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 822.74ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 64.7MB in the beginning and 117.4MB in the end (delta: -52.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:17:37,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:17:37,873 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 06:17:37,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:17:37,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:17:37,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:17:37,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:17:37,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:17:37,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:17:37,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:17:37,926 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:17:37,926 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:17:37,927 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:17:37,927 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:17:37,927 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:17:37,928 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:17:37,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:17:37,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:17:37,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:17:37,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:17:37,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:17:37,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:17:37,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:17:37,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:17:37,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:17:37,938 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:17:37,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:17:37,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:17:37,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:17:37,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:17:37,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:17:37,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:17:37,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:17:37,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:17:37,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:17:37,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:17:37,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:17:37,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:17:37,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:17:37,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:17:37,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:17:37,942 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:17:37,943 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:17:37,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:17:37,943 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:17:37,944 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_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 -> d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d [2024-11-09 06:17:38,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:17:38,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:17:38,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:17:38,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:17:38,419 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:17:38,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i Unable to find full path for "g++" [2024-11-09 06:17:40,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:17:40,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:17:40,978 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2024-11-09 06:17:41,000 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data/7567d2d9e/7fdcb1ce62ac4966959af149268da2d7/FLAGabad94f46 [2024-11-09 06:17:41,181 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/data/7567d2d9e/7fdcb1ce62ac4966959af149268da2d7 [2024-11-09 06:17:41,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:17:41,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:17:41,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:17:41,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:17:41,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:17:41,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:17:41" (1/1) ... [2024-11-09 06:17:41,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331c51ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:41, skipping insertion in model container [2024-11-09 06:17:41,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:17:41" (1/1) ... [2024-11-09 06:17:41,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:17:41,828 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:17:41,861 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:17:41,866 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:17:41,872 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:17:41,880 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:17:41,961 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:17:41,962 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:17:41,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:17:41,967 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:17:41,970 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:17:41,972 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:17:41,974 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:17:41,975 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:17:41,981 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:17:41,983 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:17:41,986 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:17:41,987 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:17:41,989 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:17:41,990 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:17:41,995 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:17:42,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:17:42,018 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 06:17:42,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:17:42,064 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:17:42,093 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:17:42,096 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:17:42,102 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:17:42,115 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:17:42,147 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:17:42,148 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:17:42,150 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:17:42,158 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:17:42,161 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:17:42,167 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:17:42,171 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:17:42,172 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:17:42,177 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:17:42,179 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:17:42,181 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:17:42,182 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:17:42,185 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:17:42,188 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:17:42,195 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:17:42,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:17:42,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:17:42,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:17:42,451 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:17:42,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42 WrapperNode [2024-11-09 06:17:42,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:17:42,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:17:42,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:17:42,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:17:42,462 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:17:42" (1/1) ... [2024-11-09 06:17:42,519 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:17:42" (1/1) ... [2024-11-09 06:17:42,617 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1196 [2024-11-09 06:17:42,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:17:42,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:17:42,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:17:42,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:17:42,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:17:42,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:17:42,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:17:42,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:17:42,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (1/1) ... [2024-11-09 06:17:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:17:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:17:42,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:42,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:17:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:17:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 06:17:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 06:17:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:17:42,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:17:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 06:17:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:17:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 06:17:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:17:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:17:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:17:43,167 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:17:43,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:17:43,197 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 06:17:48,626 INFO L? ?]: Removed 1312 outVars from TransFormulas that were not future-live. [2024-11-09 06:17:48,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:17:48,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:17:48,680 INFO L316 CfgBuilder]: Removed 66 assume(true) statements. [2024-11-09 06:17:48,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:17:48 BoogieIcfgContainer [2024-11-09 06:17:48,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:17:48,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:17:48,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:17:48,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:17:48,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:17:41" (1/3) ... [2024-11-09 06:17:48,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdd19e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:17:48, skipping insertion in model container [2024-11-09 06:17:48,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:42" (2/3) ... [2024-11-09 06:17:48,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdd19e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:17:48, skipping insertion in model container [2024-11-09 06:17:48,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:17:48" (3/3) ... [2024-11-09 06:17:48,693 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-2.i [2024-11-09 06:17:48,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:17:48,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 632 error locations. [2024-11-09 06:17:48,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:17:48,813 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;@6883ce46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:17:48,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 632 error locations. [2024-11-09 06:17:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 1280 states, 637 states have (on average 2.2213500784929354) internal successors, (1415), 1273 states have internal predecessors, (1415), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 06:17:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:17:48,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:48,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:17:48,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:17:48,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 47731, now seen corresponding path program 1 times [2024-11-09 06:17:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:17:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150347083] [2024-11-09 06:17:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:48,852 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:17:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:17:48,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:48,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:49,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:17:49,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:49,168 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:49,195 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:17:49,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:17:49,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:17:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150347083] [2024-11-09 06:17:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150347083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:17:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:17:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:17:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027600635] [2024-11-09 06:17:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:17:49,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:17:49,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:17:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:17:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:17:49,286 INFO L87 Difference]: Start difference. First operand has 1280 states, 637 states have (on average 2.2213500784929354) internal successors, (1415), 1273 states have internal predecessors, (1415), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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:17:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:17:51,888 INFO L93 Difference]: Finished difference Result 1455 states and 1548 transitions. [2024-11-09 06:17:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:17:51,891 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:17:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:17:51,916 INFO L225 Difference]: With dead ends: 1455 [2024-11-09 06:17:51,917 INFO L226 Difference]: Without dead ends: 1453 [2024-11-09 06:17:51,918 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:17:51,924 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 1184 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:17:51,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 955 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 06:17:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-09 06:17:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1265. [2024-11-09 06:17:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 639 states have (on average 2.081377151799687) internal successors, (1330), 1258 states have internal predecessors, (1330), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:17:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1348 transitions. [2024-11-09 06:17:52,021 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1348 transitions. Word has length 3 [2024-11-09 06:17:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:17:52,021 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1348 transitions. [2024-11-09 06:17:52,021 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:17:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1348 transitions. [2024-11-09 06:17:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:17:52,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:52,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:17:52,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 06:17:52,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:52,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:17:52,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 47732, now seen corresponding path program 1 times [2024-11-09 06:17:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:17:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854617576] [2024-11-09 06:17:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:52,227 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:17:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:17:52,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:52,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:52,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:17:52,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:52,374 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:17:52,389 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:17:52,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:17:52,390 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:17:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854617576] [2024-11-09 06:17:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854617576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:17:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:17:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:17:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138123815] [2024-11-09 06:17:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:17:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:17:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:17:52,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:17:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:17:52,393 INFO L87 Difference]: Start difference. First operand 1265 states and 1348 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:17:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:17:56,184 INFO L93 Difference]: Finished difference Result 1887 states and 2027 transitions. [2024-11-09 06:17:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:17:56,185 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:17:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:17:56,191 INFO L225 Difference]: With dead ends: 1887 [2024-11-09 06:17:56,191 INFO L226 Difference]: Without dead ends: 1887 [2024-11-09 06:17:56,192 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:17:56,193 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 667 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:17:56,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1772 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 06:17:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-11-09 06:17:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1475. [2024-11-09 06:17:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 850 states have (on average 2.0658823529411765) internal successors, (1756), 1468 states have internal predecessors, (1756), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:17:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1774 transitions. [2024-11-09 06:17:56,235 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1774 transitions. Word has length 3 [2024-11-09 06:17:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:17:56,236 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1774 transitions. [2024-11-09 06:17:56,236 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:17:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1774 transitions. [2024-11-09 06:17:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:17:56,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:56,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:17:56,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:56,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:56,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:17:56,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1130822653, now seen corresponding path program 1 times [2024-11-09 06:17:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:17:56,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709929232] [2024-11-09 06:17:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:56,440 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:17:56,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:17:56,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:56,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:17:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:56,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:17:56,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:56,625 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:17:56,638 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:56,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:17:56,730 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:17:56,753 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:17:56,753 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:56,783 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:17:56,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:17:56,783 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:17:56,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709929232] [2024-11-09 06:17:56,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709929232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:17:56,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:17:56,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:17:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009931701] [2024-11-09 06:17:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:17:56,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:17:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:17:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:17:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:17:56,786 INFO L87 Difference]: Start difference. First operand 1475 states and 1774 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:18:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:00,343 INFO L93 Difference]: Finished difference Result 1657 states and 1968 transitions. [2024-11-09 06:18:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:00,344 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:18:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:00,349 INFO L225 Difference]: With dead ends: 1657 [2024-11-09 06:18:00,350 INFO L226 Difference]: Without dead ends: 1657 [2024-11-09 06:18:00,350 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:18:00,351 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 1487 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:00,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 578 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 06:18:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-09 06:18:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1253. [2024-11-09 06:18:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 639 states have (on average 2.0610328638497655) internal successors, (1317), 1246 states have internal predecessors, (1317), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1335 transitions. [2024-11-09 06:18:00,380 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1335 transitions. Word has length 7 [2024-11-09 06:18:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:00,381 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1335 transitions. [2024-11-09 06:18:00,383 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:18:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1335 transitions. [2024-11-09 06:18:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:18:00,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:00,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:00,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Ended with exit code 0 [2024-11-09 06:18:00,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:00,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:00,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 695763858, now seen corresponding path program 1 times [2024-11-09 06:18:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358962040] [2024-11-09 06:18:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:00,588 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:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:00,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:00,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:00,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:18:00,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:00,730 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:00,746 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:18:00,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:00,746 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358962040] [2024-11-09 06:18:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358962040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:00,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:18:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23430917] [2024-11-09 06:18:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:00,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:18:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:18:00,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:18:00,749 INFO L87 Difference]: Start difference. First operand 1253 states and 1335 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:18:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:03,246 INFO L93 Difference]: Finished difference Result 1588 states and 1702 transitions. [2024-11-09 06:18:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:18:03,247 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:18:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:03,252 INFO L225 Difference]: With dead ends: 1588 [2024-11-09 06:18:03,252 INFO L226 Difference]: Without dead ends: 1588 [2024-11-09 06:18:03,253 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:18:03,254 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 947 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:03,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1550 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 06:18:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-09 06:18:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1204. [2024-11-09 06:18:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 639 states have (on average 1.9843505477308294) internal successors, (1268), 1197 states have internal predecessors, (1268), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1286 transitions. [2024-11-09 06:18:03,289 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1286 transitions. Word has length 8 [2024-11-09 06:18:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:03,290 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1286 transitions. [2024-11-09 06:18:03,290 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:18:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1286 transitions. [2024-11-09 06:18:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:18:03,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:03,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:03,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:03,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:03,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash 695763859, now seen corresponding path program 1 times [2024-11-09 06:18:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093776761] [2024-11-09 06:18:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:03,495 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:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:03,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:03,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:03,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:18:03,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:03,649 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:03,677 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:18:03,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:03,678 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093776761] [2024-11-09 06:18:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093776761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:18:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879801039] [2024-11-09 06:18:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:03,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:18:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:18:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:18:03,680 INFO L87 Difference]: Start difference. First operand 1204 states and 1286 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:18:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:06,735 INFO L93 Difference]: Finished difference Result 1677 states and 1794 transitions. [2024-11-09 06:18:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:18:06,736 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:18:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:06,741 INFO L225 Difference]: With dead ends: 1677 [2024-11-09 06:18:06,741 INFO L226 Difference]: Without dead ends: 1677 [2024-11-09 06:18:06,741 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:18:06,742 INFO L432 NwaCegarLoop]: 1391 mSDtfsCounter, 697 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:06,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1946 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 06:18:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2024-11-09 06:18:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1231. [2024-11-09 06:18:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 676 states have (on average 1.970414201183432) internal successors, (1332), 1224 states have internal predecessors, (1332), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1350 transitions. [2024-11-09 06:18:06,768 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1350 transitions. Word has length 8 [2024-11-09 06:18:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:06,769 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1350 transitions. [2024-11-09 06:18:06,769 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:18:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1350 transitions. [2024-11-09 06:18:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:18:06,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:06,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:06,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:06,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:06,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:06,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 190250923, now seen corresponding path program 1 times [2024-11-09 06:18:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207785380] [2024-11-09 06:18:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:06,972 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:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:06,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:06,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:07,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:18:07,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:07,224 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:18:07,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:07,224 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:07,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207785380] [2024-11-09 06:18:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207785380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:07,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:07,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665603254] [2024-11-09 06:18:07,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:07,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:07,228 INFO L87 Difference]: Start difference. First operand 1231 states and 1350 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:18:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:08,119 INFO L93 Difference]: Finished difference Result 1833 states and 2039 transitions. [2024-11-09 06:18:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:08,120 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:18:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:08,125 INFO L225 Difference]: With dead ends: 1833 [2024-11-09 06:18:08,125 INFO L226 Difference]: Without dead ends: 1833 [2024-11-09 06:18:08,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:08,126 INFO L432 NwaCegarLoop]: 1405 mSDtfsCounter, 640 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:08,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 3843 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:18:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-09 06:18:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1482. [2024-11-09 06:18:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 927 states have (on average 1.941747572815534) internal successors, (1800), 1475 states have internal predecessors, (1800), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1818 transitions. [2024-11-09 06:18:08,176 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1818 transitions. Word has length 12 [2024-11-09 06:18:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:08,176 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1818 transitions. [2024-11-09 06:18:08,177 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:18:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1818 transitions. [2024-11-09 06:18:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 06:18:08,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:08,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:08,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:08,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1606047345, now seen corresponding path program 1 times [2024-11-09 06:18:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717159357] [2024-11-09 06:18:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:08,381 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:08,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:08,384 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:08,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:08,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:18:08,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:08,539 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:18:08,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:08,539 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717159357] [2024-11-09 06:18:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717159357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:18:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376141471] [2024-11-09 06:18:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:08,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:18:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:18:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:18:08,541 INFO L87 Difference]: Start difference. First operand 1482 states and 1818 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:08,571 INFO L93 Difference]: Finished difference Result 1420 states and 1728 transitions. [2024-11-09 06:18:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:18:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 06:18:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:08,575 INFO L225 Difference]: With dead ends: 1420 [2024-11-09 06:18:08,575 INFO L226 Difference]: Without dead ends: 1420 [2024-11-09 06:18:08,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:18:08,576 INFO L432 NwaCegarLoop]: 1211 mSDtfsCounter, 71 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2359 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:18:08,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2359 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:18:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-09 06:18:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2024-11-09 06:18:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 889 states have (on average 1.923509561304837) internal successors, (1710), 1413 states have internal predecessors, (1710), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1728 transitions. [2024-11-09 06:18:08,603 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1728 transitions. Word has length 14 [2024-11-09 06:18:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 1728 transitions. [2024-11-09 06:18:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1728 transitions. [2024-11-09 06:18:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:18:08,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:08,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:08,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:08,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1750356376, now seen corresponding path program 1 times [2024-11-09 06:18:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989163412] [2024-11-09 06:18:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:08,806 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:08,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:08,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:08,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:08,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:18:08,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:08,987 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:18:08,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:08,987 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989163412] [2024-11-09 06:18:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989163412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:08,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:08,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:08,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325093488] [2024-11-09 06:18:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:08,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:08,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:08,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:08,989 INFO L87 Difference]: Start difference. First operand 1420 states and 1728 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:09,090 INFO L93 Difference]: Finished difference Result 1390 states and 1670 transitions. [2024-11-09 06:18:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:18:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 06:18:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:09,096 INFO L225 Difference]: With dead ends: 1390 [2024-11-09 06:18:09,096 INFO L226 Difference]: Without dead ends: 1390 [2024-11-09 06:18:09,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:18:09,098 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 48 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3472 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:18:09,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3472 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:18:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-09 06:18:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2024-11-09 06:18:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 873 states have (on average 1.8923253150057273) internal successors, (1652), 1383 states have internal predecessors, (1652), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1670 transitions. [2024-11-09 06:18:09,141 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1670 transitions. Word has length 15 [2024-11-09 06:18:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:09,142 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1670 transitions. [2024-11-09 06:18:09,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1670 transitions. [2024-11-09 06:18:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:18:09,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:09,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:09,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Ended with exit code 0 [2024-11-09 06:18:09,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr630ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:09,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:09,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1682543935, now seen corresponding path program 1 times [2024-11-09 06:18:09,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:09,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506409048] [2024-11-09 06:18:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:09,346 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,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:09,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:09,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:18:09,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:09,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:18:09,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:18:09,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:18:09,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 06:18:09,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:18:09,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 06:18:09,615 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:18:09,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:09,615 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506409048] [2024-11-09 06:18:09,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506409048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:09,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:09,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:09,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072519365] [2024-11-09 06:18:09,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:09,618 INFO L87 Difference]: Start difference. First operand 1390 states and 1670 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:18:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:10,877 INFO L93 Difference]: Finished difference Result 1855 states and 2210 transitions. [2024-11-09 06:18:10,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-09 06:18:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:10,883 INFO L225 Difference]: With dead ends: 1855 [2024-11-09 06:18:10,884 INFO L226 Difference]: Without dead ends: 1855 [2024-11-09 06:18:10,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:18:10,885 INFO L432 NwaCegarLoop]: 1146 mSDtfsCounter, 457 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:10,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3320 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:18:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2024-11-09 06:18:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1389. [2024-11-09 06:18:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 872 states have (on average 1.8922018348623852) internal successors, (1650), 1382 states have internal predecessors, (1650), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1668 transitions. [2024-11-09 06:18:10,926 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1668 transitions. Word has length 16 [2024-11-09 06:18:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:10,927 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1668 transitions. [2024-11-09 06:18:10,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:18:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1668 transitions. [2024-11-09 06:18:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:18:10,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:10,928 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:18:10,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 06:18:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:11,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:11,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash -927421553, now seen corresponding path program 1 times [2024-11-09 06:18:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686174816] [2024-11-09 06:18:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:11,130 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:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:11,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:11,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:11,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:18:11,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:11,352 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:18:11,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:11,352 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686174816] [2024-11-09 06:18:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686174816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:11,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:18:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734734854] [2024-11-09 06:18:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:11,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:18:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:18:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:18:11,354 INFO L87 Difference]: Start difference. First operand 1389 states and 1668 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:18:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:11,391 INFO L93 Difference]: Finished difference Result 1327 states and 1578 transitions. [2024-11-09 06:18:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:18:11,392 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:18:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:11,396 INFO L225 Difference]: With dead ends: 1327 [2024-11-09 06:18:11,396 INFO L226 Difference]: Without dead ends: 1327 [2024-11-09 06:18:11,396 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:18:11,397 INFO L432 NwaCegarLoop]: 1131 mSDtfsCounter, 71 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2199 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:18:11,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2199 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:18:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-11-09 06:18:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2024-11-09 06:18:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 834 states have (on average 1.870503597122302) internal successors, (1560), 1320 states have internal predecessors, (1560), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1578 transitions. [2024-11-09 06:18:11,419 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1578 transitions. Word has length 19 [2024-11-09 06:18:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1578 transitions. [2024-11-09 06:18:11,420 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:18:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1578 transitions. [2024-11-09 06:18:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:18:11,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:11,421 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:18:11,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:11,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:11,622 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:11,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1316485504, now seen corresponding path program 1 times [2024-11-09 06:18:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802833605] [2024-11-09 06:18:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:11,623 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:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:11,626 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:11,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:11,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:18:11,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:11,835 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:18:11,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:11,835 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802833605] [2024-11-09 06:18:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802833605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:11,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927826225] [2024-11-09 06:18:11,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:11,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:11,837 INFO L87 Difference]: Start difference. First operand 1327 states and 1578 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:18:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:11,926 INFO L93 Difference]: Finished difference Result 1297 states and 1520 transitions. [2024-11-09 06:18:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:18:11,927 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:18:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:11,929 INFO L225 Difference]: With dead ends: 1297 [2024-11-09 06:18:11,930 INFO L226 Difference]: Without dead ends: 1297 [2024-11-09 06:18:11,930 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:18:11,930 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 48 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3232 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:18:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3232 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:18:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-11-09 06:18:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2024-11-09 06:18:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 818 states have (on average 1.8361858190709046) internal successors, (1502), 1290 states have internal predecessors, (1502), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1520 transitions. [2024-11-09 06:18:11,950 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1520 transitions. Word has length 20 [2024-11-09 06:18:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:11,951 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1520 transitions. [2024-11-09 06:18:11,951 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:18:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1520 transitions. [2024-11-09 06:18:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:18:11,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:11,952 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:18:11,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:12,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:12,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:12,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1802854638, now seen corresponding path program 1 times [2024-11-09 06:18:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425585188] [2024-11-09 06:18:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:12,155 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:12,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:12,158 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:12,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:12,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:18:12,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:12,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:18:12,483 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:18:12,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:12,483 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425585188] [2024-11-09 06:18:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425585188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:12,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:18:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952061928] [2024-11-09 06:18:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:12,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:12,485 INFO L87 Difference]: Start difference. First operand 1297 states and 1520 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:18:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:15,407 INFO L93 Difference]: Finished difference Result 1694 states and 2031 transitions. [2024-11-09 06:18:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:15,407 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:18:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:15,413 INFO L225 Difference]: With dead ends: 1694 [2024-11-09 06:18:15,413 INFO L226 Difference]: Without dead ends: 1694 [2024-11-09 06:18:15,413 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:18:15,414 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 798 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:15,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1543 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 06:18:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-09 06:18:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1293. [2024-11-09 06:18:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 818 states have (on average 1.82640586797066) internal successors, (1494), 1286 states have internal predecessors, (1494), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1512 transitions. [2024-11-09 06:18:15,434 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1512 transitions. Word has length 34 [2024-11-09 06:18:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:15,435 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1512 transitions. [2024-11-09 06:18:15,435 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:18:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1512 transitions. [2024-11-09 06:18:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:18:15,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:15,436 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:18:15,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:15,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:15,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1802854639, now seen corresponding path program 1 times [2024-11-09 06:18:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011125404] [2024-11-09 06:18:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:15,638 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:15,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:15,641 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:15,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:15,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:18:15,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:15,880 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:16,115 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:18:16,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:16,116 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011125404] [2024-11-09 06:18:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011125404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:16,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:16,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:18:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503179529] [2024-11-09 06:18:16,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:16,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:16,118 INFO L87 Difference]: Start difference. First operand 1293 states and 1512 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:18:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:19,992 INFO L93 Difference]: Finished difference Result 1809 states and 2123 transitions. [2024-11-09 06:18:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:19,992 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:18:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:19,998 INFO L225 Difference]: With dead ends: 1809 [2024-11-09 06:18:19,998 INFO L226 Difference]: Without dead ends: 1809 [2024-11-09 06:18:19,998 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:18:19,998 INFO L432 NwaCegarLoop]: 1312 mSDtfsCounter, 544 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:19,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 2637 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 06:18:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-09 06:18:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1289. [2024-11-09 06:18:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 818 states have (on average 1.8166259168704157) internal successors, (1486), 1282 states have internal predecessors, (1486), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1504 transitions. [2024-11-09 06:18:20,031 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1504 transitions. Word has length 34 [2024-11-09 06:18:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:20,031 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1504 transitions. [2024-11-09 06:18:20,032 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:18:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1504 transitions. [2024-11-09 06:18:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:18:20,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:20,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:20,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:20,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:20,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:20,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1430728313, now seen corresponding path program 1 times [2024-11-09 06:18:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:20,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298133853] [2024-11-09 06:18:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:20,240 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:20,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:20,243 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:20,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:20,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:18:20,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:20,554 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:18:20,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:20,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298133853] [2024-11-09 06:18:20,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298133853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:20,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060922859] [2024-11-09 06:18:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:20,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:20,556 INFO L87 Difference]: Start difference. First operand 1289 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:20,635 INFO L93 Difference]: Finished difference Result 1277 states and 1484 transitions. [2024-11-09 06:18:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:18:20,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 06:18:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:20,641 INFO L225 Difference]: With dead ends: 1277 [2024-11-09 06:18:20,642 INFO L226 Difference]: Without dead ends: 1277 [2024-11-09 06:18:20,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:20,643 INFO L432 NwaCegarLoop]: 1080 mSDtfsCounter, 21 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3209 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:18:20,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3209 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:18:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-11-09 06:18:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2024-11-09 06:18:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 806 states have (on average 1.8188585607940446) internal successors, (1466), 1270 states have internal predecessors, (1466), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1484 transitions. [2024-11-09 06:18:20,664 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1484 transitions. Word has length 53 [2024-11-09 06:18:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:20,665 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1484 transitions. [2024-11-09 06:18:20,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1484 transitions. [2024-11-09 06:18:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:18:20,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:20,670 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:18:20,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:20,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:20,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:20,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:20,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1584737093, now seen corresponding path program 1 times [2024-11-09 06:18:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510567635] [2024-11-09 06:18:20,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:20,872 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:20,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:20,875 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:20,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:21,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:18:21,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:21,241 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:21,251 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:21,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:18:21,891 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:18:21,906 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:18:21,906 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:21,918 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:18:21,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:21,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510567635] [2024-11-09 06:18:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510567635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:21,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:21,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:18:21,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533424102] [2024-11-09 06:18:21,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:21,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:21,920 INFO L87 Difference]: Start difference. First operand 1277 states and 1484 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:18:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:24,736 INFO L93 Difference]: Finished difference Result 1632 states and 1957 transitions. [2024-11-09 06:18:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:24,737 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:18:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:24,742 INFO L225 Difference]: With dead ends: 1632 [2024-11-09 06:18:24,742 INFO L226 Difference]: Without dead ends: 1632 [2024-11-09 06:18:24,742 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:18:24,743 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 1757 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:24,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 812 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:18:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-11-09 06:18:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1202. [2024-11-09 06:18:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 769 states have (on average 1.7607282184655397) internal successors, (1354), 1195 states have internal predecessors, (1354), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1372 transitions. [2024-11-09 06:18:24,757 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1372 transitions. Word has length 61 [2024-11-09 06:18:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1372 transitions. [2024-11-09 06:18:24,758 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:18:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1372 transitions. [2024-11-09 06:18:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:18:24,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:24,759 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:18:24,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:24,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:24,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -717148443, now seen corresponding path program 1 times [2024-11-09 06:18:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597494999] [2024-11-09 06:18:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:24,961 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:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:24,962 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:24,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:25,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:18:25,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:25,291 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:25,305 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:18:25,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:18:25,343 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:18:25,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:25,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597494999] [2024-11-09 06:18:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597494999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650849777] [2024-11-09 06:18:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:25,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:18:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:18:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:25,345 INFO L87 Difference]: Start difference. First operand 1202 states and 1372 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:18:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:28,158 INFO L93 Difference]: Finished difference Result 1201 states and 1371 transitions. [2024-11-09 06:18:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:18:28,159 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:18:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:28,163 INFO L225 Difference]: With dead ends: 1201 [2024-11-09 06:18:28,163 INFO L226 Difference]: Without dead ends: 1201 [2024-11-09 06:18:28,163 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:18:28,164 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 2 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:28,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2736 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:18:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-11-09 06:18:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2024-11-09 06:18:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 769 states have (on average 1.7594278283485045) internal successors, (1353), 1194 states have internal predecessors, (1353), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1371 transitions. [2024-11-09 06:18:28,178 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1371 transitions. Word has length 66 [2024-11-09 06:18:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1371 transitions. [2024-11-09 06:18:28,178 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:18:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1371 transitions. [2024-11-09 06:18:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:18:28,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:28,179 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:18:28,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:28,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:28,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash -717148442, now seen corresponding path program 1 times [2024-11-09 06:18:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:28,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792340562] [2024-11-09 06:18:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:28,381 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:28,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:28,382 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:28,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:18:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:28,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 06:18:28,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:28,742 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:28,762 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:28,772 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:18:28,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 06:18:28,852 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:18:28,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:28,852 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792340562] [2024-11-09 06:18:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792340562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91726386] [2024-11-09 06:18:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:28,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:18:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:28,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:18:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:28,854 INFO L87 Difference]: Start difference. First operand 1201 states and 1371 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:18:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:32,474 INFO L93 Difference]: Finished difference Result 1200 states and 1370 transitions. [2024-11-09 06:18:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:18:32,475 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:18:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:32,478 INFO L225 Difference]: With dead ends: 1200 [2024-11-09 06:18:32,478 INFO L226 Difference]: Without dead ends: 1200 [2024-11-09 06:18:32,479 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:18:32,479 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 1 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:32,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2786 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 06:18:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-09 06:18:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2024-11-09 06:18:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 768 states have (on average 1.7604166666666667) internal successors, (1352), 1193 states have internal predecessors, (1352), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1370 transitions. [2024-11-09 06:18:32,496 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1370 transitions. Word has length 66 [2024-11-09 06:18:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:32,496 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1370 transitions. [2024-11-09 06:18:32,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1370 transitions. [2024-11-09 06:18:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 06:18:32,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:32,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 06:18:32,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:32,702 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:32,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash -26367956, now seen corresponding path program 1 times [2024-11-09 06:18:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857301505] [2024-11-09 06:18:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:32,703 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:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:32,704 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:32,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (19)] Waiting until timeout for monitored process [2024-11-09 06:18:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:33,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:18:33,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:33,072 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:18:33,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:18:33,072 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857301505] [2024-11-09 06:18:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857301505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:33,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42096630] [2024-11-09 06:18:33,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:33,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:33,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:33,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:33,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:33,075 INFO L87 Difference]: Start difference. First operand 1200 states and 1370 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:18:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:33,117 INFO L93 Difference]: Finished difference Result 1203 states and 1374 transitions. [2024-11-09 06:18:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:33,118 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:18:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:33,122 INFO L225 Difference]: With dead ends: 1203 [2024-11-09 06:18:33,122 INFO L226 Difference]: Without dead ends: 1203 [2024-11-09 06:18:33,122 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:18:33,122 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 0 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3154 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:18:33,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3154 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:18:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-11-09 06:18:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2024-11-09 06:18:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 770 states have (on average 1.7597402597402598) internal successors, (1355), 1196 states have internal predecessors, (1355), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:18:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1374 transitions. [2024-11-09 06:18:33,147 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1374 transitions. Word has length 74 [2024-11-09 06:18:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:33,148 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1374 transitions. [2024-11-09 06:18:33,148 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:18:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1374 transitions. [2024-11-09 06:18:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 06:18:33,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:33,149 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:18:33,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (19)] Ended with exit code 0 [2024-11-09 06:18:33,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:33,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:33,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash -82405016, now seen corresponding path program 1 times [2024-11-09 06:18:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028992347] [2024-11-09 06:18:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:33,351 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:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:33,354 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:33,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (20)] Waiting until timeout for monitored process [2024-11-09 06:18:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:33,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:18:33,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:33,721 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:18:33,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:33,815 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:18:33,815 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028992347] [2024-11-09 06:18:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028992347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [256725193] [2024-11-09 06:18:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:18:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:18:33,821 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:18:33,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 06:18:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:34,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:18:34,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:34,415 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:18:34,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:34,444 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:18:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [256725193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613221263] [2024-11-09 06:18:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:34,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:34,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:18:34,448 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:34,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 06:18:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:34,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:18:34,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:34,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:18:34,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:34,808 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:18:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613221263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:34,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:18:34,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-09 06:18:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623683295] [2024-11-09 06:18:34,810 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:18:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:18:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:18:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:18:34,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:18:34,812 INFO L87 Difference]: Start difference. First operand 1203 states and 1374 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:18:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:34,986 INFO L93 Difference]: Finished difference Result 1215 states and 1391 transitions. [2024-11-09 06:18:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:18:34,987 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:18:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:34,994 INFO L225 Difference]: With dead ends: 1215 [2024-11-09 06:18:34,994 INFO L226 Difference]: Without dead ends: 1215 [2024-11-09 06:18:34,994 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:18:34,995 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 8 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4205 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:34,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4205 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:18:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-09 06:18:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1213. [2024-11-09 06:18:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 779 states have (on average 1.7586649550706033) internal successors, (1370), 1205 states have internal predecessors, (1370), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:18:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1389 transitions. [2024-11-09 06:18:35,012 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1389 transitions. Word has length 75 [2024-11-09 06:18:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:35,013 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1389 transitions. [2024-11-09 06:18:35,013 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:18:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1389 transitions. [2024-11-09 06:18:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:18:35,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:35,014 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:18:35,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (20)] Ended with exit code 0 [2024-11-09 06:18:35,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:35,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 06:18:35,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:35,615 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:18:35,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1505629996, now seen corresponding path program 2 times [2024-11-09 06:18:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:18:35,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075219820] [2024-11-09 06:18:35,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:18:35,616 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:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:18:35,618 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:35,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 06:18:36,080 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:18:36,080 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:18:36,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:18:36,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:36,147 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:18:36,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:36,315 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:18:36,315 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075219820] [2024-11-09 06:18:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075219820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1827195544] [2024-11-09 06:18:36,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:18:36,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:18:36,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:18:36,317 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:18:36,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-09 06:18:37,872 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:18:37,873 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:18:37,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:18:37,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:37,926 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:18:37,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:37,985 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:18:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1827195544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:37,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49755731] [2024-11-09 06:18:37,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:18:37,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:37,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:18:37,987 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:37,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 06:19:08,002 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:19:08,002 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:19:08,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:19:08,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:08,185 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:19:08,185 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:08,217 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:08,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:19:08,504 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:19:08,573 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:19:08,607 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:19:08,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:08,726 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:19:08,726 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:19:08,735 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1653 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-09 06:19:08,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49755731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:19:08,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:19:08,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-09 06:19:08,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509712239] [2024-11-09 06:19:08,744 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:19:08,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:19:08,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:19:08,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2024-11-09 06:19:08,746 INFO L87 Difference]: Start difference. First operand 1213 states and 1389 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:19:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:20,525 INFO L93 Difference]: Finished difference Result 1622 states and 1923 transitions. [2024-11-09 06:19:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 06:19:20,526 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:19:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:20,534 INFO L225 Difference]: With dead ends: 1622 [2024-11-09 06:19:20,534 INFO L226 Difference]: Without dead ends: 1618 [2024-11-09 06:19:20,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2024-11-09 06:19:20,536 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 745 mSDsluCounter, 7992 mSDsCounter, 0 mSdLazyCounter, 5974 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 8675 SdHoareTripleChecker+Invalid, 5999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:20,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 8675 Invalid, 5999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 5974 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-09 06:19:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-11-09 06:19:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1221. [2024-11-09 06:19:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 788 states have (on average 1.75253807106599) internal successors, (1381), 1213 states have internal predecessors, (1381), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:19:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1400 transitions. [2024-11-09 06:19:20,578 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1400 transitions. Word has length 78 [2024-11-09 06:19:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:20,579 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1400 transitions. [2024-11-09 06:19:20,579 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:19:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1400 transitions. [2024-11-09 06:19:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 06:19:20,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:20,585 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:19:20,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:20,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:20,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:21,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:19:21,186 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:19:21,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash -813847123, now seen corresponding path program 1 times [2024-11-09 06:19:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707227523] [2024-11-09 06:19:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:21,188 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:19:21,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:21,189 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:19:21,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Waiting until timeout for monitored process [2024-11-09 06:19:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:21,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:19:21,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:21,735 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:19:21,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:22,275 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:19:22,276 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707227523] [2024-11-09 06:19:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707227523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773165286] [2024-11-09 06:19:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:19:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:19:22,279 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:19:22,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-09 06:19:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:23,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:19:23,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:23,078 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:19:23,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:23,250 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:19:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773165286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986279129] [2024-11-09 06:19:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:23,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:23,252 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:19:23,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-09 06:19:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:23,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:19:23,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:23,800 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:19:23,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:24,697 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:19:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986279129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:24,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:19:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-09 06:19:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460592874] [2024-11-09 06:19:24,698 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:19:24,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:19:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:19:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 06:19:24,700 INFO L87 Difference]: Start difference. First operand 1221 states and 1400 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:19:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:26,896 INFO L93 Difference]: Finished difference Result 1247 states and 1441 transitions. [2024-11-09 06:19:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 06:19:26,897 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:19:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:26,900 INFO L225 Difference]: With dead ends: 1247 [2024-11-09 06:19:26,901 INFO L226 Difference]: Without dead ends: 1241 [2024-11-09 06:19:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 06:19:26,903 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 20 mSDsluCounter, 14695 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15748 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:26,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15748 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:19:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-09 06:19:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2024-11-09 06:19:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 806 states have (on average 1.7419354838709677) internal successors, (1404), 1231 states have internal predecessors, (1404), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:19:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1423 transitions. [2024-11-09 06:19:26,935 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1423 transitions. Word has length 84 [2024-11-09 06:19:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:26,936 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1423 transitions. [2024-11-09 06:19:26,936 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:19:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1423 transitions. [2024-11-09 06:19:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 06:19:26,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:26,937 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:19:26,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:27,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:27,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:19:27,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:19:27,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:19:27,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -362530131, now seen corresponding path program 2 times [2024-11-09 06:19:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191507557] [2024-11-09 06:19:27,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:19:27,539 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:19:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:27,540 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:19:27,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (29)] Waiting until timeout for monitored process [2024-11-09 06:19:28,116 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:19:28,116 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:19:28,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:19:28,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:28,642 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:19:28,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:30,343 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:19:30,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191507557] [2024-11-09 06:19:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191507557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [729096374] [2024-11-09 06:19:30,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:19:30,344 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:19:30,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:19:30,347 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:19:30,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-09 06:19:32,312 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:19:32,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:19:32,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:19:32,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:32,407 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:19:32,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:32,755 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:19:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [729096374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933107740] [2024-11-09 06:19:32,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:19:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:32,757 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:19:32,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-09 06:20:04,089 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:20:04,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:20:04,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:20:04,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:04,120 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:04,300 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:20:04,318 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:20:04,318 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:20:04,424 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:20:04,435 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:04,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 06:20:04,787 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:20:05,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:05,517 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:20:05,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:20:05,720 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:20:05,728 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:20:05,825 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:20:05,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:06,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2957 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2957 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2957) |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_2956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933107740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:06,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:20:06,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-09 06:20:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262562331] [2024-11-09 06:20:06,686 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:20:06,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 06:20:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:06,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 06:20:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-09 06:20:06,688 INFO L87 Difference]: Start difference. First operand 1239 states and 1423 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:20:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:45,847 INFO L93 Difference]: Finished difference Result 1675 states and 2007 transitions. [2024-11-09 06:20:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-09 06:20:45,849 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:20:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:45,852 INFO L225 Difference]: With dead ends: 1675 [2024-11-09 06:20:45,852 INFO L226 Difference]: Without dead ends: 1667 [2024-11-09 06:20:45,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3100, Invalid=14459, Unknown=1, NotChecked=262, Total=17822 [2024-11-09 06:20:45,857 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 765 mSDsluCounter, 20248 mSDsCounter, 0 mSdLazyCounter, 15905 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 20938 SdHoareTripleChecker+Invalid, 15974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 15905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:45,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 20938 Invalid, 15974 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [69 Valid, 15905 Invalid, 0 Unknown, 0 Unchecked, 30.5s Time] [2024-11-09 06:20:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-09 06:20:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1272. [2024-11-09 06:20:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 840 states have (on average 1.7202380952380953) internal successors, (1445), 1264 states have internal predecessors, (1445), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:20:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1464 transitions. [2024-11-09 06:20:45,876 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1464 transitions. Word has length 96 [2024-11-09 06:20:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:45,877 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1464 transitions. [2024-11-09 06:20:45,877 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:20:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1464 transitions. [2024-11-09 06:20:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:20:45,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:45,879 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:20:45,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (29)] Ended with exit code 0 [2024-11-09 06:20:46,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-09 06:20:46,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-09 06:20:46,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:46,480 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:20:46,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1733854398, now seen corresponding path program 1 times [2024-11-09 06:20:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235687117] [2024-11-09 06:20:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:46,481 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:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:46,484 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:46,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Waiting until timeout for monitored process [2024-11-09 06:20:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:47,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:20:47,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:47,341 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:47,489 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:20:47,490 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:47,529 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:47,679 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:48,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:48,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:20:48,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:48,924 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:48,952 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:48,986 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:48,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:49,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 (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_3381) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:20:49,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3381 (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_3427))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3381)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:49,518 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235687117] [2024-11-09 06:20:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235687117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [622005043] [2024-11-09 06:20:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:49,519 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:20:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:20:49,520 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:20:49,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-09 06:20:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:51,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 06:20:51,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:51,832 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:51,962 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:20:51,963 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:51,988 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:52,056 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:53,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:53,130 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:53,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:53,207 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:53,232 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:53,242 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:53,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:53,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3851 (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_3851) |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:53,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3851 (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_3851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:20:53,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3851 (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_3897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3851)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:20:53,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [622005043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:53,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961978442] [2024-11-09 06:20:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:53,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:20:53,764 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:20:53,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-09 06:20:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:54,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 06:20:54,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:54,397 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:54,516 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:20:54,516 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:20:54,545 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:55,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:55,351 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:55,522 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:55,522 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:55,544 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:55,549 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:55,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:56,077 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 06:20:56,078 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:20:56,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4366 (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_4366))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3381)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 06:20:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961978442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:56,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:20:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-09 06:20:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077610902] [2024-11-09 06:20:56,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:20:56,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 06:20:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 06:20:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=348, Unknown=14, NotChecked=258, Total=702 [2024-11-09 06:20:56,093 INFO L87 Difference]: Start difference. First operand 1272 states and 1464 transitions. Second operand has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 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:21:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:07,852 INFO L93 Difference]: Finished difference Result 1666 states and 1976 transitions. [2024-11-09 06:21:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:21:07,852 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 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:21:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:07,855 INFO L225 Difference]: With dead ends: 1666 [2024-11-09 06:21:07,855 INFO L226 Difference]: Without dead ends: 1666 [2024-11-09 06:21:07,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=459, Unknown=14, NotChecked=294, Total=870 [2024-11-09 06:21:07,855 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 718 mSDsluCounter, 6540 mSDsCounter, 0 mSdLazyCounter, 6080 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 7222 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:07,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 7222 Invalid, 6096 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 6080 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-09 06:21:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-09 06:21:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1271. [2024-11-09 06:21:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 840 states have (on average 1.7190476190476192) internal successors, (1444), 1263 states have internal predecessors, (1444), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:21:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1463 transitions. [2024-11-09 06:21:07,874 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1463 transitions. Word has length 121 [2024-11-09 06:21:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1463 transitions. [2024-11-09 06:21:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 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:21:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1463 transitions. [2024-11-09 06:21:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:21:07,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:07,876 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:21:07,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:08,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:08,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:21:08,477 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:21:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1733854397, now seen corresponding path program 1 times [2024-11-09 06:21:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:21:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053014944] [2024-11-09 06:21:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:08,479 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:21:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:21:08,480 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:21:08,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-09 06:21:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:09,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-09 06:21:09,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:09,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:21:09,556 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:21:09,556 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:09,564 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:21:09,593 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:09,599 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:21:09,769 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:21:09,775 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:21:10,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:10,564 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:21:10,570 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:21:10,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:10,692 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:21:10,697 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:21:10,725 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:21:10,731 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:21:10,759 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:10,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:10,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4837) |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_4836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:21:10,914 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_4836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4837) |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:21:12,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4928))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4929) .cse0 v_ArrVal_4837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4929 (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_4929) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2024-11-09 06:21:12,336 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:21:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053014944] [2024-11-09 06:21:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053014944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [404860608] [2024-11-09 06:21:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:12,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:21:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:21:12,338 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:21:12,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-09 06:22:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:34,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-09 06:22:34,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:34,682 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:34,815 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:22:34,815 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:34,821 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:22:34,835 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:34,840 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:34,903 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:34,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 06:22:35,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:35,571 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:35,579 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:35,651 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:35,651 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:35,658 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:35,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 06:22:35,696 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:35,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:22:35,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:37,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5400 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5492))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5491) .cse0 v_ArrVal_5400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5400 (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_5491) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2024-11-09 06:22:37,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [404860608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:37,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584681266] [2024-11-09 06:22:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:37,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:37,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:22:37,442 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:22:37,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-09 06:22:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:38,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 06:22:38,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:38,158 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:38,278 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:38,290 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:22:38,290 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:38,300 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:38,304 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:38,369 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:38,373 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:39,039 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:39,039 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:39,044 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:39,111 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:39,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:22:39,122 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:39,159 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:39,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 06:22:39,172 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:39,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:39,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5963 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5962) |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_5963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5962 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5962) |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:22:39,274 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_5962 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5963 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:22:40,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6055 (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_6055) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6054))) (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~mem36#1.base| v_ArrVal_6055) .cse2 v_ArrVal_5962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:22:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584681266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:40,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:22:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-09 06:22:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869619979] [2024-11-09 06:22:40,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:22:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:22:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:22:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:22:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=142, Unknown=18, NotChecked=210, Total=420 [2024-11-09 06:22:40,710 INFO L87 Difference]: Start difference. First operand 1271 states and 1463 transitions. Second operand has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:22:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:49,517 INFO L93 Difference]: Finished difference Result 1663 states and 1973 transitions. [2024-11-09 06:22:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:22:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2024-11-09 06:22:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:49,520 INFO L225 Difference]: With dead ends: 1663 [2024-11-09 06:22:49,520 INFO L226 Difference]: Without dead ends: 1663 [2024-11-09 06:22:49,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 357 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=266, Unknown=18, NotChecked=280, Total=650 [2024-11-09 06:22:49,521 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 718 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 3895 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:49,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 3071 Invalid, 3902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3895 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-09 06:22:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-09 06:22:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1270. [2024-11-09 06:22:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 840 states have (on average 1.7178571428571427) internal successors, (1443), 1262 states have internal predecessors, (1443), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:22:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1462 transitions. [2024-11-09 06:22:49,536 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1462 transitions. Word has length 121 [2024-11-09 06:22:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1462 transitions. [2024-11-09 06:22:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:22:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1462 transitions. [2024-11-09 06:22:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:22:49,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:49,539 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:22:49,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:49,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:49,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:50,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:22:50,140 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:22:50,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1979365229, now seen corresponding path program 1 times [2024-11-09 06:22:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:22:50,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414910768] [2024-11-09 06:22:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:50,141 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:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:22:50,142 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:50,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (38)] Waiting until timeout for monitored process [2024-11-09 06:22:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:51,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 06:22:51,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:51,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:22:51,285 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:22:51,286 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:22:51,311 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:51,409 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:22:52,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:52,342 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:22:52,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:52,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:22:52,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:52,611 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:22:52,638 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:22:52,679 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:52,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:52,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6495) |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:22:52,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6495 (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_6495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:22:52,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6494))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6495)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-09 06:22:52,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6495 (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_6494))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6495)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:22:53,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6541 (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_6541))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6494)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6495)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:22:53,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:22:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414910768] [2024-11-09 06:22:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414910768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2011394736] [2024-11-09 06:22:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:53,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:22:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:22:53,237 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:22:53,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-09 06:23:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:30,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:23:30,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:30,173 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:30,363 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:23:30,364 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:23:30,383 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:30,467 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:23:31,406 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:31,406 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:23:31,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:31,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:23:31,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:31,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:23:31,561 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:23:31,570 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:31,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:23:31,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6981) |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:23:31,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6981 (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_6981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:23:31,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6981 (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_6980))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6981)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:23:31,627 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6981 (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_6980))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6981)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:23:32,103 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6981 (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_7027))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6980)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6981)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:23:32,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2011394736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:32,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631186895] [2024-11-09 06:23:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:32,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:32,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:23:32,108 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:23:32,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-09 06:23:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:32,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:23:32,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:32,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:23:33,066 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:23:33,066 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:33,093 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:33,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:33,459 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:23:33,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:33,543 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:23:33,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:33,624 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:23:33,679 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:23:33,682 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:33,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:23:33,719 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:23:33,719 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:23:33,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7466 (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_7466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 06:23:33,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7466 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7465)) (.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_7466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 06:23:33,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7466 (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_7465))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:23:34,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7466 (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_7512))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7465)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:23:34,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631186895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:34,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:23:34,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-09 06:23:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822077713] [2024-11-09 06:23:34,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:23:34,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:23:34,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:23:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:23:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=389, Unknown=23, NotChecked=742, Total=1260 [2024-11-09 06:23:34,255 INFO L87 Difference]: Start difference. First operand 1270 states and 1462 transitions. Second operand has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 20 states have internal predecessors, (101), 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:23:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:45,846 INFO L93 Difference]: Finished difference Result 1664 states and 1974 transitions. [2024-11-09 06:23:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:23:45,846 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 20 states have internal predecessors, (101), 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:23:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:45,848 INFO L225 Difference]: With dead ends: 1664 [2024-11-09 06:23:45,848 INFO L226 Difference]: Without dead ends: 1664 [2024-11-09 06:23:45,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=424, Unknown=23, NotChecked=770, Total=1332 [2024-11-09 06:23:45,849 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 713 mSDsluCounter, 6175 mSDsCounter, 0 mSdLazyCounter, 5380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 6858 SdHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:45,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 6858 Invalid, 5395 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 5380 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-09 06:23:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-11-09 06:23:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1269. [2024-11-09 06:23:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 840 states have (on average 1.7166666666666666) internal successors, (1442), 1261 states have internal predecessors, (1442), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:23:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1461 transitions. [2024-11-09 06:23:45,861 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1461 transitions. Word has length 124 [2024-11-09 06:23:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:45,861 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1461 transitions. [2024-11-09 06:23:45,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 20 states have internal predecessors, (101), 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:23:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1461 transitions. [2024-11-09 06:23:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:23:45,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:45,863 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:23:45,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (38)] Forceful destruction successful, exit code 0 [2024-11-09 06:23:46,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-09 06:23:46,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2024-11-09 06:23:46,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:23:46,464 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:23:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1979365228, now seen corresponding path program 1 times [2024-11-09 06:23:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:23:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133732370] [2024-11-09 06:23:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:46,465 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:23:46,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:23:46,466 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:23:46,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2024-11-09 06:23:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:47,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 06:23:47,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:47,551 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:47,661 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:23:47,661 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:47,667 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:47,687 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:47,691 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:47,792 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:47,797 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:48,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:48,526 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:48,541 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:48,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:48,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:23:48,652 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:48,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:23:48,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:23:48,758 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:48,785 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:48,790 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:48,833 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:48,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:23:48,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-09 06:23:48,993 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_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2024-11-09 06:23:49,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7997))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7998) .cse0 v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7998) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8000) |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:23:49,067 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_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7997))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7998) .cse1 v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7998) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 06:23:50,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8091))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7997))) (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~mem36#1.base| v_ArrVal_8092) .cse0 v_ArrVal_7998) .cse1 v_ArrVal_8000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7997 (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_8091))) (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_8092) .cse6 v_ArrVal_7998) (select (select (store .cse7 .cse6 v_ArrVal_7997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8000))) |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:23:50,502 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:23:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133732370] [2024-11-09 06:23:50,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133732370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1062166982] [2024-11-09 06:23:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:50,503 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:23:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:23:50,506 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:23:50,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2024-11-09 06:24:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:40,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 06:24:40,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:40,692 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:24:40,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:24:40,839 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:24:40,840 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:24:40,851 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:24:40,859 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:40,923 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:40,928 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:41,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:41,631 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:41,638 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:41,736 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:41,737 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:41,744 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:41,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:41,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:41,847 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:41,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 06:24:41,886 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:41,894 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:41,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:41,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_8580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-09 06:24:41,981 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_8580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8579) |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:24:42,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8577))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8578) .cse0 v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8578) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-09 06:24:42,093 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_8580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8577))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8578) .cse1 v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8578) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 06:24:44,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8671))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8577))) (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~mem36#1.base| v_ArrVal_8672) .cse0 v_ArrVal_8578) .cse1 v_ArrVal_8579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8577 (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_8671))) (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_8672) .cse6 v_ArrVal_8578) (select (select (store .cse7 .cse6 v_ArrVal_8577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8579))) |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:24:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1062166982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46816518] [2024-11-09 06:24:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:24:44,362 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:24:44,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-09 06:24:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:45,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 06:24:45,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:45,742 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:24:45,742 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:24:45,756 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:24:45,775 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:45,785 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:24:45,934 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:45,942 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:47,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:47,667 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:47,677 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:47,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:47,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:24:47,852 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:47,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:47,976 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:47,985 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:48,043 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:48,051 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:48,066 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:48,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:48,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-09 06:24:48,202 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_9158 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:24:48,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9157 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9156))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9157) .cse0 v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9157 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9157) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9156) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9158) |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:24:48,323 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_9156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9157 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9156))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9157) .cse1 v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9157 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9157) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9156) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 06:24:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46816518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:52,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:24:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-09 06:24:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115559598] [2024-11-09 06:24:52,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:52,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:24:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:24:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:24:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=156, Unknown=19, NotChecked=518, Total=756 [2024-11-09 06:24:52,188 INFO L87 Difference]: Start difference. First operand 1269 states and 1461 transitions. Second operand has 11 states, 9 states have (on average 9.333333333333334) internal successors, (84), 11 states have internal predecessors, (84), 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:25:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:12,962 INFO L93 Difference]: Finished difference Result 1661 states and 1971 transitions. [2024-11-09 06:25:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:25:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.333333333333334) internal successors, (84), 11 states have internal predecessors, (84), 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:25:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:12,966 INFO L225 Difference]: With dead ends: 1661 [2024-11-09 06:25:12,966 INFO L226 Difference]: Without dead ends: 1661 [2024-11-09 06:25:12,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 368 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=102, Invalid=314, Unknown=20, NotChecked=686, Total=1122 [2024-11-09 06:25:12,967 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 716 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 3887 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:12,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 3090 Invalid, 3894 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 3887 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2024-11-09 06:25:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-09 06:25:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1268. [2024-11-09 06:25:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 840 states have (on average 1.7154761904761904) internal successors, (1441), 1260 states have internal predecessors, (1441), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:25:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1460 transitions. [2024-11-09 06:25:12,989 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1460 transitions. Word has length 124 [2024-11-09 06:25:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:12,989 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1460 transitions. [2024-11-09 06:25:12,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.333333333333334) internal successors, (84), 11 states have internal predecessors, (84), 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:25:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1460 transitions. [2024-11-09 06:25:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:25:12,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:12,990 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:25:13,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:13,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2024-11-09 06:25:13,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:13,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:25:13,593 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:25:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1663219511, now seen corresponding path program 1 times [2024-11-09 06:25:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:25:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800477211] [2024-11-09 06:25:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:13,595 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:25:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:25:13,598 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:25:13,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2024-11-09 06:25:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:15,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:25:15,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:15,197 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:25:15,670 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:25:15,670 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:25:15,736 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:25:15,978 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:25:18,112 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:18,112 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:25:18,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:18,392 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:25:18,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:18,631 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:25:18,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:18,874 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:25:18,938 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:25:19,045 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:25:19,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:19,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9707) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-11-09 06:25:19,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (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_9707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:25:19,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9706))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9707)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:25:19,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9706 (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_9706))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9707)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:25:19,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9705 (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~mem38#1.base| v_ArrVal_9705))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9706)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9707)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:25:19,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9705 (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_9705))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9706)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9707)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:25:20,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9753))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9705)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9706)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9707)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:25:20,156 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:25:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800477211] [2024-11-09 06:25:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800477211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1564924284] [2024-11-09 06:25:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:20,157 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:25:20,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:25:20,158 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:25:20,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2024-11-09 06:26:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:15,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 06:26:15,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:26:15,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:26:15,727 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:26:15,727 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:26:15,766 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:26:15,928 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:26:17,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:17,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:26:18,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:18,161 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:26:18,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:18,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:26:18,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:18,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:26:18,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 33 treesize of output 15 [2024-11-09 06:26:18,544 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:26:18,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:26:18,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10209) |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:26:18,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10209 (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_10209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:26:18,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10208))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10209)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:26:18,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (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~mem38#1.base| v_ArrVal_10207))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10208)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10209)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:26:18,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (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_10207))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10208)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10209)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:26:19,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (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_10255))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10207)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10208)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10209)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:26:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1564924284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012424181] [2024-11-09 06:26:19,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:26:19,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:26:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:26:19,655 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:26:19,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-09 06:26:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:20,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 06:26:20,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:26:20,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:26:21,211 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:26:21,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:26:21,317 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:26:22,441 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:22,442 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:26:22,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:22,650 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:26:22,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:22,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 31 treesize of output 32 [2024-11-09 06:26:23,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:23,099 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:26:23,299 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:26:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:26:23,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:26:23,394 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:26:23,395 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:26:23,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10710 (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_10710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 06:26:23,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10710 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10709)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-09 06:26:23,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10710 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10709))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:26:23,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10710 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10708))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10709)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:26:23,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10710 (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_10708))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10709)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:26:24,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10756 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10710 (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~mem36#1.base| v_ArrVal_10756))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10708)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10709)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:26:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012424181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:24,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:26:24,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2024-11-09 06:26:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450151833] [2024-11-09 06:26:24,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:26:24,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:26:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:26:24,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:26:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=505, Unknown=36, NotChecked=1216, Total=1892 [2024-11-09 06:26:24,760 INFO L87 Difference]: Start difference. First operand 1268 states and 1460 transitions. Second operand has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 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:26:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:26:42,939 INFO L93 Difference]: Finished difference Result 1662 states and 1972 transitions. [2024-11-09 06:26:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:26:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 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:26:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:26:42,949 INFO L225 Difference]: With dead ends: 1662 [2024-11-09 06:26:42,953 INFO L226 Difference]: Without dead ends: 1662 [2024-11-09 06:26:42,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=145, Invalid=545, Unknown=36, NotChecked=1254, Total=1980 [2024-11-09 06:26:42,954 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 712 mSDsluCounter, 3909 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 4591 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:26:42,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 4591 Invalid, 3485 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2024-11-09 06:26:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-09 06:26:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1267. [2024-11-09 06:26:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 840 states have (on average 1.7142857142857142) internal successors, (1440), 1259 states have internal predecessors, (1440), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 06:26:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1459 transitions. [2024-11-09 06:26:42,994 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1459 transitions. Word has length 127 [2024-11-09 06:26:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:26:42,995 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1459 transitions. [2024-11-09 06:26:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 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:26:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1459 transitions. [2024-11-09 06:26:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:26:42,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:26:42,997 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:26:43,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2024-11-09 06:26:43,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2024-11-09 06:26:43,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2024-11-09 06:26:43,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:26:43,598 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-09 06:26:43,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:26:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1663219510, now seen corresponding path program 1 times [2024-11-09 06:26:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:26:43,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306267877] [2024-11-09 06:26:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:26:43,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:26:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:26:43,601 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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:26:43,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/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 (47)] Waiting until timeout for monitored process [2024-11-09 06:26:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:45,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 06:26:45,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:26:45,161 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:26:45,606 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:26:45,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:26:45,650 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:26:45,711 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:26:45,722 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:26:46,023 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:26:46,032 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:26:47,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:47,858 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:26:47,870 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:26:48,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:48,165 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:26:48,176 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:26:48,428 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:48,429 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:26:48,440 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:26:48,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:48,700 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:26:48,711 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:26:48,788 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:26:48,798 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:26:48,887 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:26:48,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:26:49,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11261) |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:26:49,251 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_11260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11261) |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:26:49,346 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11258) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11259) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11259))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11258) .cse2 v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:26:50,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11257))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11259))) (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~mem38#1.base| v_ArrVal_11256) .cse0 v_ArrVal_11258) .cse1 v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11257))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11256) .cse6 v_ArrVal_11258) (select (select (store .cse7 .cse6 v_ArrVal_11259) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11261))) |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:26:50,776 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_11257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11257))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11256) .cse2 v_ArrVal_11258) (select (select (store .cse3 .cse2 v_ArrVal_11259) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11261))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11257))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11259))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11256) .cse5 v_ArrVal_11258) .cse6 v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 06:26:55,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11352))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11257))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11259))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11353) .cse0 v_ArrVal_11256) .cse1 v_ArrVal_11258) .cse2 v_ArrVal_11261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11352))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11257))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11353) .cse8 v_ArrVal_11256) .cse9 v_ArrVal_11258) (select (select (store .cse10 .cse9 v_ArrVal_11259) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11261))))) |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:26:55,607 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:26:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306267877] [2024-11-09 06:26:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306267877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1994958300] [2024-11-09 06:26:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:26:55,608 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:26:55,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:26:55,609 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:26:55,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2024-11-09 06:31:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:19,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-09 06:31:19,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:19,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 7 [2024-11-09 06:31:21,845 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:31:21,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:31:21,918 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:31:22,000 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:31:22,039 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:31:22,716 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:31:22,755 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:31:30,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:31:30,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:31:30,357 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:31:31,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:31:31,104 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:31:31,146 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:31:31,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:31:31,762 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:31:31,801 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:31:32,397 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:31:32,397 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:31:32,435 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:31:32,735 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:31:32,774 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:31:32,812 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:31:32,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:33,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11858 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11857) |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~mem40#1.base| v_ArrVal_11858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11857) |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:31:33,318 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_11857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11858 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-09 06:31:33,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11855) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11856) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11858 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11856))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11855) .cse2 v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:31:33,826 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_11855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11855) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11856) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11858 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11856))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11855) .cse3 v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_11858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:31:52,206 WARN L286 SmtUtils]: Spent 7.14s 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:31:55,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11858 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11950))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11854))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11856))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11949) .cse0 v_ArrVal_11853) .cse1 v_ArrVal_11855) .cse2 v_ArrVal_11857) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11950))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11854))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11949) .cse8 v_ArrVal_11853) .cse9 v_ArrVal_11855) (select (select (store .cse10 .cse9 v_ArrVal_11856) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11857))))) |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:31:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1994958300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901577554] [2024-11-09 06:31:55,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:55,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:55,721 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:55,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2dde26-a978-40a8-b45a-acbfef3d7252/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-09 06:31:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:56,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 06:31:56,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:56,863 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:32:00,978 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:32:00,978 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:32:01,117 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:32:01,257 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:32:01,328 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:32:02,617 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:32:02,694 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:32:16,736 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:16,736 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:32:16,807 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:32:18,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:18,148 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:32:18,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:32:19,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:19,348 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:32:19,421 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:32:20,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:20,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:32:20,610 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:32:21,169 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:32:21,238 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:32:21,308 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:32:21,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:32:23,664 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_12454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:32:24,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12452) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12453))) (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~mem39#1.base| v_ArrVal_12452) .cse2 v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:32:24,435 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_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12452) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12453))) (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_12452) .cse3 v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:32:24,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12451))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_12453))) (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~mem38#1.base| v_ArrVal_12450) .cse0 v_ArrVal_12452) .cse1 v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12451))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12450) .cse6 v_ArrVal_12452) (select (select (store .cse7 .cse6 v_ArrVal_12453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12454))) |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:32:26,336 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_12455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12451))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12453))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12450) .cse1 v_ArrVal_12452) .cse2 v_ArrVal_12454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12451))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12450) .cse7 v_ArrVal_12452) (select (select (store .cse8 .cse7 v_ArrVal_12453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false