./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 241cbbc1863278905c5862751ae4b8363464962676a0cc42dc0ceaf22f2782d4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:29:02,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:29:02,543 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:29:02,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:29:02,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:29:02,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:29:02,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:29:02,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:29:02,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:29:02,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:29:02,588 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:29:02,588 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:29:02,588 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:29:02,589 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:29:02,589 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:29:02,589 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:29:02,590 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:29:02,590 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:29:02,590 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:29:02,590 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:29:02,590 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:29:02,591 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:29:02,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:29:02,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:29:02,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:29:02,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:29:02,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:29:02,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:29:02,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:29:02,593 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:29:02,593 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:29:02,593 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:29:02,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:29:02,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:29:02,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:29:02,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:29:02,594 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:29:02,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:29:02,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:29:02,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:29:02,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:29:02,596 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:29:02,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:29:02,596 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 241cbbc1863278905c5862751ae4b8363464962676a0cc42dc0ceaf22f2782d4 [2024-11-14 05:29:02,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:29:02,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:29:02,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:29:02,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:29:02,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:29:02,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i Unable to find full path for "g++" [2024-11-14 05:29:04,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:29:05,425 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:29:05,426 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i [2024-11-14 05:29:05,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data/985e02ec3/a2ff29b1fe2d4b21b6e8294654de7f98/FLAG3e7156cd2 [2024-11-14 05:29:05,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data/985e02ec3/a2ff29b1fe2d4b21b6e8294654de7f98 [2024-11-14 05:29:05,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:29:05,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:29:05,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:29:05,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:29:05,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:29:05,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:05" (1/1) ... [2024-11-14 05:29:05,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14691ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:05, skipping insertion in model container [2024-11-14 05:29:05,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:05" (1/1) ... [2024-11-14 05:29:05,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:29:06,180 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,229 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,238 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,243 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,251 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,305 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,309 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,317 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,332 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,381 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,381 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,390 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,391 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,427 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,427 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,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-14 05:29:06,432 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,463 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,463 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,465 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,466 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,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-14 05:29:06,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-14 05:29:06,497 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,497 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,499 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,505 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,509 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,510 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,511 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,517 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,522 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,528 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,528 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,532 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:06,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:29:06,564 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-14 05:29:06,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3114130f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:06, skipping insertion in model container [2024-11-14 05:29:06,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:29:06,566 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-14 05:29:06,569 INFO L158 Benchmark]: Toolchain (without parser) took 1100.82ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 62.5MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 05:29:06,573 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:29:06,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1097.61ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 62.5MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 05:29:06,575 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.45ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1097.61ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 62.5MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 241cbbc1863278905c5862751ae4b8363464962676a0cc42dc0ceaf22f2782d4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:29:09,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:29:09,313 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 05:29:09,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:29:09,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:29:09,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:29:09,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:29:09,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:29:09,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:29:09,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:29:09,356 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:29:09,356 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:29:09,357 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:29:09,357 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:29:09,357 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:29:09,357 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:29:09,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:29:09,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:29:09,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:29:09,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:29:09,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:29:09,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:29:09,360 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:29:09,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:29:09,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:29:09,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:29:09,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:29:09,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:29:09,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:29:09,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:29:09,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:29:09,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:29:09,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:29:09,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:29:09,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:29:09,363 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:29:09,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:29:09,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:29:09,364 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:29:09,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 241cbbc1863278905c5862751ae4b8363464962676a0cc42dc0ceaf22f2782d4 [2024-11-14 05:29:09,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:29:09,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:29:09,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:29:09,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:29:09,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:29:09,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i Unable to find full path for "g++" [2024-11-14 05:29:11,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:29:12,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:29:12,219 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i [2024-11-14 05:29:12,250 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data/ec1ec5fd8/07267b9281e24a03862a3018dcb3f2c7/FLAG7139f92d6 [2024-11-14 05:29:12,277 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/data/ec1ec5fd8/07267b9281e24a03862a3018dcb3f2c7 [2024-11-14 05:29:12,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:29:12,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:29:12,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:29:12,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:29:12,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:29:12,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:12" (1/1) ... [2024-11-14 05:29:12,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33dad676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:12, skipping insertion in model container [2024-11-14 05:29:12,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:12" (1/1) ... [2024-11-14 05:29:12,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:29:13,140 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,210 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,217 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,230 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,246 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,287 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,290 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,294 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,301 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,339 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,340 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,364 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,364 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,368 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,368 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,387 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,388 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,391 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,392 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,410 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,410 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,413 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,413 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,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-14 05:29:13,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-14 05:29:13,421 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,422 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,423 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,429 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,430 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,432 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,433 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,438 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:29:13,464 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-14 05:29:13,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:29:13,521 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,559 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,561 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,564 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,574 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,612 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,618 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,620 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,628 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,650 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,651 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,653 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,653 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,670 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,671 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,674 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,675 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,697 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,698 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,701 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,703 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,717 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,718 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,720 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,720 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,724 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,726 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,728 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,728 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,729 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,733 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,734 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,737 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,742 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:29:13,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:29:13,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:29:13,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:29:14,042 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:29:14,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14 WrapperNode [2024-11-14 05:29:14,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:29:14,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:29:14,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:29:14,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:29:14,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,228 INFO L138 Inliner]: procedures = 180, calls = 606, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2496 [2024-11-14 05:29:14,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:29:14,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:29:14,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:29:14,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:29:14,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:29:14,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:29:14,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:29:14,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:29:14,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (1/1) ... [2024-11-14 05:29:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:29:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:14,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:29:14,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:29:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 05:29:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-14 05:29:14,607 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-14 05:29:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:29:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 05:29:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 05:29:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 05:29:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 05:29:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:29:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:29:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:29:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:29:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:29:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:29:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:29:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:29:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:29:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:29:14,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:29:14,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:29:14,991 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 05:29:26,879 INFO L? ?]: Removed 2427 outVars from TransFormulas that were not future-live. [2024-11-14 05:29:26,879 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:29:26,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:29:26,938 INFO L316 CfgBuilder]: Removed 168 assume(true) statements. [2024-11-14 05:29:26,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:26 BoogieIcfgContainer [2024-11-14 05:29:26,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:29:26,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:29:26,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:29:26,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:29:26,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:29:12" (1/3) ... [2024-11-14 05:29:26,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dee90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:26, skipping insertion in model container [2024-11-14 05:29:26,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:14" (2/3) ... [2024-11-14 05:29:26,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dee90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:26, skipping insertion in model container [2024-11-14 05:29:26,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:26" (3/3) ... [2024-11-14 05:29:26,950 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-3.i [2024-11-14 05:29:26,967 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:29:26,969 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test10-3.i that has 4 procedures, 2456 locations, 1 initial locations, 91 loop locations, and 1189 error locations. [2024-11-14 05:29:27,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:29:27,062 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;@176a6b6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:29:27,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1189 error locations. [2024-11-14 05:29:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 1255 states have (on average 2.201593625498008) internal successors, (2763), 2442 states have internal predecessors, (2763), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:29:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:29:27,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:27,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:29:27,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:29:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2024-11-14 05:29:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:29:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730391756] [2024-11-14 05:29:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:27,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:29:27,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:29:27,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:29:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:27,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:29:27,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:27,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:29:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:27,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:29:27,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:29:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730391756] [2024-11-14 05:29:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730391756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:29:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:29:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:29:27,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869866738] [2024-11-14 05:29:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:29:27,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:29:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:29:27,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:29:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:29:27,489 INFO L87 Difference]: Start difference. First operand has 2456 states, 1255 states have (on average 2.201593625498008) internal successors, (2763), 2442 states have internal predecessors, (2763), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-14 05:29:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:33,258 INFO L93 Difference]: Finished difference Result 3291 states and 3491 transitions. [2024-11-14 05:29:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:29:33,260 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-14 05:29:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:33,293 INFO L225 Difference]: With dead ends: 3291 [2024-11-14 05:29:33,293 INFO L226 Difference]: Without dead ends: 3289 [2024-11-14 05:29:33,295 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-14 05:29:33,299 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 2320 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:33,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 2245 Invalid, 1690 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-14 05:29:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2024-11-14 05:29:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2600. [2024-11-14 05:29:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 1427 states have (on average 2.0385423966363) internal successors, (2909), 2584 states have internal predecessors, (2909), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:29:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 2941 transitions. [2024-11-14 05:29:33,459 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 2941 transitions. Word has length 3 [2024-11-14 05:29:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 2600 states and 2941 transitions. [2024-11-14 05:29:33,460 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-14 05:29:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 2941 transitions. [2024-11-14 05:29:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:29:33,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:33,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:29:33,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 05:29:33,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:33,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:29:33,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2024-11-14 05:29:33,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:29:33,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696501446] [2024-11-14 05:29:33,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:33,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:33,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:29:33,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:29:33,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:29:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:33,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:29:33,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:29:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:33,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:29:33,923 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:29:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696501446] [2024-11-14 05:29:33,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696501446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:29:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:29:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:29:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404503870] [2024-11-14 05:29:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:29:33,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:29:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:29:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:29:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:29:33,928 INFO L87 Difference]: Start difference. First operand 2600 states and 2941 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-14 05:29:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:41,278 INFO L93 Difference]: Finished difference Result 3401 states and 3822 transitions. [2024-11-14 05:29:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:29:41,280 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-14 05:29:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:41,292 INFO L225 Difference]: With dead ends: 3401 [2024-11-14 05:29:41,292 INFO L226 Difference]: Without dead ends: 3401 [2024-11-14 05:29:41,292 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-14 05:29:41,293 INFO L432 NwaCegarLoop]: 2226 mSDtfsCounter, 875 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3629 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:41,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3629 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-14 05:29:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2024-11-14 05:29:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3073. [2024-11-14 05:29:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 1898 states have (on average 1.993677555321391) internal successors, (3784), 3054 states have internal predecessors, (3784), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 05:29:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3822 transitions. [2024-11-14 05:29:41,380 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3822 transitions. Word has length 3 [2024-11-14 05:29:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:41,380 INFO L471 AbstractCegarLoop]: Abstraction has 3073 states and 3822 transitions. [2024-11-14 05:29:41,380 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-14 05:29:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3822 transitions. [2024-11-14 05:29:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:29:41,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:41,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:41,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:29:41,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:41,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:29:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2024-11-14 05:29:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:29:41,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439895643] [2024-11-14 05:29:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:41,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:29:41,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:29:41,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:29:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:41,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:29:41,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:41,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:29:41,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-14 05:29:41,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:29:41,958 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:29:41,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:29:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:41,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:29:41,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:29:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439895643] [2024-11-14 05:29:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439895643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:29:41,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:29:41,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:29:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904223918] [2024-11-14 05:29:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:29:41,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:29:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:29:41,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:29:41,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:29:41,993 INFO L87 Difference]: Start difference. First operand 3073 states and 3822 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-14 05:29:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:55,100 INFO L93 Difference]: Finished difference Result 5338 states and 6237 transitions. [2024-11-14 05:29:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:29:55,101 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-14 05:29:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:55,121 INFO L225 Difference]: With dead ends: 5338 [2024-11-14 05:29:55,121 INFO L226 Difference]: Without dead ends: 5338 [2024-11-14 05:29:55,122 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-14 05:29:55,122 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 2384 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:55,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3396 Invalid, 4350 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2024-11-14 05:29:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2024-11-14 05:29:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 3793. [2024-11-14 05:29:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3793 states, 2618 states have (on average 2.0206264323911385) internal successors, (5290), 3768 states have internal predecessors, (5290), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:29:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 5340 transitions. [2024-11-14 05:29:55,248 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 5340 transitions. Word has length 7 [2024-11-14 05:29:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:55,248 INFO L471 AbstractCegarLoop]: Abstraction has 3793 states and 5340 transitions. [2024-11-14 05:29:55,248 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-14 05:29:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 5340 transitions. [2024-11-14 05:29:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:29:55,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:55,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:55,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 05:29:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:55,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:29:55,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2024-11-14 05:29:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:29:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925947310] [2024-11-14 05:29:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:55,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:29:55,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:29:55,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:29:55,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:29:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:55,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:29:55,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:55,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:29:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:55,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:29:55,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:29:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925947310] [2024-11-14 05:29:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925947310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:29:55,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:29:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:29:55,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755602949] [2024-11-14 05:29:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:29:55,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:29:55,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:29:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:29:55,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:29:55,693 INFO L87 Difference]: Start difference. First operand 3793 states and 5340 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-14 05:30:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:00,286 INFO L93 Difference]: Finished difference Result 4505 states and 6010 transitions. [2024-11-14 05:30:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:00,287 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-14 05:30:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:00,300 INFO L225 Difference]: With dead ends: 4505 [2024-11-14 05:30:00,301 INFO L226 Difference]: Without dead ends: 4505 [2024-11-14 05:30:00,301 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-14 05:30:00,302 INFO L432 NwaCegarLoop]: 2412 mSDtfsCounter, 1920 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:00,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 3180 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 05:30:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2024-11-14 05:30:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3701. [2024-11-14 05:30:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 2618 states have (on average 1.9385026737967914) internal successors, (5075), 3676 states have internal predecessors, (5075), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5125 transitions. [2024-11-14 05:30:00,401 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5125 transitions. Word has length 8 [2024-11-14 05:30:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:00,402 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 5125 transitions. [2024-11-14 05:30:00,402 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-14 05:30:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5125 transitions. [2024-11-14 05:30:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:30:00,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:00,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:00,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 05:30:00,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:00,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2024-11-14 05:30:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:00,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114858799] [2024-11-14 05:30:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:00,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:00,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:00,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:00,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 05:30:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:00,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:30:00,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:00,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-14 05:30:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:00,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:00,864 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114858799] [2024-11-14 05:30:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114858799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:30:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014559582] [2024-11-14 05:30:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:00,865 INFO L87 Difference]: Start difference. First operand 3701 states and 5125 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-14 05:30:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:07,676 INFO L93 Difference]: Finished difference Result 5506 states and 7585 transitions. [2024-11-14 05:30:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:07,677 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-14 05:30:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:07,694 INFO L225 Difference]: With dead ends: 5506 [2024-11-14 05:30:07,694 INFO L226 Difference]: Without dead ends: 5506 [2024-11-14 05:30:07,694 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-14 05:30:07,695 INFO L432 NwaCegarLoop]: 2771 mSDtfsCounter, 1423 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:07,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3974 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-14 05:30:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2024-11-14 05:30:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4045. [2024-11-14 05:30:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4045 states, 2972 states have (on average 1.9229475100942126) internal successors, (5715), 4020 states have internal predecessors, (5715), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 5765 transitions. [2024-11-14 05:30:07,782 INFO L78 Accepts]: Start accepts. Automaton has 4045 states and 5765 transitions. Word has length 8 [2024-11-14 05:30:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:07,782 INFO L471 AbstractCegarLoop]: Abstraction has 4045 states and 5765 transitions. [2024-11-14 05:30:07,782 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-14 05:30:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4045 states and 5765 transitions. [2024-11-14 05:30:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:30:07,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:07,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:07,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 05:30:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:07,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2066274645, now seen corresponding path program 1 times [2024-11-14 05:30:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817565151] [2024-11-14 05:30:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:07,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:07,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 05:30:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:08,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:30:08,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:08,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:08,213 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817565151] [2024-11-14 05:30:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817565151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:08,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:08,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:08,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107189778] [2024-11-14 05:30:08,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:08,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:08,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:08,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:08,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:08,220 INFO L87 Difference]: Start difference. First operand 4045 states and 5765 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:08,287 INFO L93 Difference]: Finished difference Result 3985 states and 5679 transitions. [2024-11-14 05:30:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 05:30:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:08,314 INFO L225 Difference]: With dead ends: 3985 [2024-11-14 05:30:08,314 INFO L226 Difference]: Without dead ends: 3985 [2024-11-14 05:30:08,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:08,317 INFO L432 NwaCegarLoop]: 2418 mSDtfsCounter, 71 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4773 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:08,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4773 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:30:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-11-14 05:30:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3985. [2024-11-14 05:30:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3985 states, 2936 states have (on average 1.917234332425068) internal successors, (5629), 3960 states have internal predecessors, (5629), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 5679 transitions. [2024-11-14 05:30:08,426 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 5679 transitions. Word has length 11 [2024-11-14 05:30:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:08,426 INFO L471 AbstractCegarLoop]: Abstraction has 3985 states and 5679 transitions. [2024-11-14 05:30:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 5679 transitions. [2024-11-14 05:30:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 05:30:08,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:08,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:08,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 05:30:08,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:08,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1415094318, now seen corresponding path program 1 times [2024-11-14 05:30:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033795717] [2024-11-14 05:30:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:08,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:08,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 05:30:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:08,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:30:08,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:08,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:08,873 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033795717] [2024-11-14 05:30:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033795717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:08,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:08,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613042730] [2024-11-14 05:30:08,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:08,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:08,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:08,874 INFO L87 Difference]: Start difference. First operand 3985 states and 5679 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:09,014 INFO L93 Difference]: Finished difference Result 3955 states and 5621 transitions. [2024-11-14 05:30:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:30:09,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-14 05:30:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:09,038 INFO L225 Difference]: With dead ends: 3955 [2024-11-14 05:30:09,039 INFO L226 Difference]: Without dead ends: 3955 [2024-11-14 05:30:09,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:09,039 INFO L432 NwaCegarLoop]: 2373 mSDtfsCounter, 48 mSDsluCounter, 4720 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7093 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:09,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7093 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2024-11-14 05:30:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3955. [2024-11-14 05:30:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 2920 states have (on average 1.9078767123287672) internal successors, (5571), 3930 states have internal predecessors, (5571), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5621 transitions. [2024-11-14 05:30:09,111 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5621 transitions. Word has length 13 [2024-11-14 05:30:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:09,112 INFO L471 AbstractCegarLoop]: Abstraction has 3955 states and 5621 transitions. [2024-11-14 05:30:09,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5621 transitions. [2024-11-14 05:30:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:30:09,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:09,113 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-14 05:30:09,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-14 05:30:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:09,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 445820031, now seen corresponding path program 1 times [2024-11-14 05:30:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087623460] [2024-11-14 05:30:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:09,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:09,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:09,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 05:30:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:09,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:30:09,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:09,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:09,627 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087623460] [2024-11-14 05:30:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087623460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:09,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528735445] [2024-11-14 05:30:09,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:09,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:09,628 INFO L87 Difference]: Start difference. First operand 3955 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-14 05:30:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:09,679 INFO L93 Difference]: Finished difference Result 3895 states and 5535 transitions. [2024-11-14 05:30:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-14 05:30:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:09,691 INFO L225 Difference]: With dead ends: 3895 [2024-11-14 05:30:09,691 INFO L226 Difference]: Without dead ends: 3895 [2024-11-14 05:30:09,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:09,692 INFO L432 NwaCegarLoop]: 2340 mSDtfsCounter, 71 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4617 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:09,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4617 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:30:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2024-11-14 05:30:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2024-11-14 05:30:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 2884 states have (on average 1.901872399445215) internal successors, (5485), 3870 states have internal predecessors, (5485), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 5535 transitions. [2024-11-14 05:30:09,747 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 5535 transitions. Word has length 20 [2024-11-14 05:30:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 3895 states and 5535 transitions. [2024-11-14 05:30:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-14 05:30:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 5535 transitions. [2024-11-14 05:30:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:30:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:09,748 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-14 05:30:09,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 05:30:09,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:09,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash -178046145, now seen corresponding path program 1 times [2024-11-14 05:30:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105741031] [2024-11-14 05:30:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:09,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:09,954 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:09,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 05:30:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:10,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:30:10,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:10,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:10,239 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105741031] [2024-11-14 05:30:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105741031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87806979] [2024-11-14 05:30:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:10,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:10,241 INFO L87 Difference]: Start difference. First operand 3895 states and 5535 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-14 05:30:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:10,301 INFO L93 Difference]: Finished difference Result 3763 states and 5277 transitions. [2024-11-14 05:30:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-14 05:30:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:10,312 INFO L225 Difference]: With dead ends: 3763 [2024-11-14 05:30:10,312 INFO L226 Difference]: Without dead ends: 3763 [2024-11-14 05:30:10,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:10,315 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 71 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:10,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4531 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:30:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2024-11-14 05:30:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3763. [2024-11-14 05:30:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3763 states, 2776 states have (on average 1.8829250720461095) internal successors, (5227), 3738 states have internal predecessors, (5227), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 5277 transitions. [2024-11-14 05:30:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 5277 transitions. Word has length 20 [2024-11-14 05:30:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:10,374 INFO L471 AbstractCegarLoop]: Abstraction has 3763 states and 5277 transitions. [2024-11-14 05:30:10,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-14 05:30:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 5277 transitions. [2024-11-14 05:30:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:30:10,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:10,377 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] [2024-11-14 05:30:10,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 05:30:10,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:10,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1063683368, now seen corresponding path program 1 times [2024-11-14 05:30:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843983233] [2024-11-14 05:30:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:10,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:10,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:10,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:10,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 05:30:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:10,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:30:10,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:10,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:10,851 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843983233] [2024-11-14 05:30:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843983233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757561392] [2024-11-14 05:30:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:10,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:10,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:10,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:10,852 INFO L87 Difference]: Start difference. First operand 3763 states and 5277 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:10,969 INFO L93 Difference]: Finished difference Result 3733 states and 5219 transitions. [2024-11-14 05:30:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:30:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-14 05:30:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:10,981 INFO L225 Difference]: With dead ends: 3733 [2024-11-14 05:30:10,981 INFO L226 Difference]: Without dead ends: 3733 [2024-11-14 05:30:10,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:10,982 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 48 mSDsluCounter, 4478 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6730 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:10,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6730 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-14 05:30:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3733. [2024-11-14 05:30:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 2760 states have (on average 1.8728260869565216) internal successors, (5169), 3708 states have internal predecessors, (5169), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5219 transitions. [2024-11-14 05:30:11,038 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5219 transitions. Word has length 22 [2024-11-14 05:30:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:11,038 INFO L471 AbstractCegarLoop]: Abstraction has 3733 states and 5219 transitions. [2024-11-14 05:30:11,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5219 transitions. [2024-11-14 05:30:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:30:11,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:11,043 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] [2024-11-14 05:30:11,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-14 05:30:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:11,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 696370136, now seen corresponding path program 1 times [2024-11-14 05:30:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958936236] [2024-11-14 05:30:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:11,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:11,246 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:11,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 05:30:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:11,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:30:11,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:11,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:11,530 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958936236] [2024-11-14 05:30:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958936236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:11,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188469930] [2024-11-14 05:30:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:11,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:11,531 INFO L87 Difference]: Start difference. First operand 3733 states and 5219 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:11,620 INFO L93 Difference]: Finished difference Result 3671 states and 5045 transitions. [2024-11-14 05:30:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:30:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-14 05:30:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:11,628 INFO L225 Difference]: With dead ends: 3671 [2024-11-14 05:30:11,628 INFO L226 Difference]: Without dead ends: 3671 [2024-11-14 05:30:11,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:11,629 INFO L432 NwaCegarLoop]: 2217 mSDtfsCounter, 48 mSDsluCounter, 4408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6625 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:11,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6625 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-11-14 05:30:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2024-11-14 05:30:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2712 states have (on average 1.8418141592920354) internal successors, (4995), 3646 states have internal predecessors, (4995), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5045 transitions. [2024-11-14 05:30:11,698 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5045 transitions. Word has length 22 [2024-11-14 05:30:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:11,698 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 5045 transitions. [2024-11-14 05:30:11,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5045 transitions. [2024-11-14 05:30:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:30:11,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:11,699 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] [2024-11-14 05:30:11,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-14 05:30:11,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:11,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 248802844, now seen corresponding path program 1 times [2024-11-14 05:30:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022202985] [2024-11-14 05:30:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:11,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:11,904 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:11,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 05:30:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:12,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:30:12,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:12,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:30:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:12,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:12,213 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022202985] [2024-11-14 05:30:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022202985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:12,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:12,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692065893] [2024-11-14 05:30:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:12,215 INFO L87 Difference]: Start difference. First operand 3671 states and 5045 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:17,644 INFO L93 Difference]: Finished difference Result 4289 states and 5578 transitions. [2024-11-14 05:30:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:30:17,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-14 05:30:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:17,655 INFO L225 Difference]: With dead ends: 4289 [2024-11-14 05:30:17,655 INFO L226 Difference]: Without dead ends: 4289 [2024-11-14 05:30:17,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:17,656 INFO L432 NwaCegarLoop]: 1524 mSDtfsCounter, 2013 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 3353 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:17,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 3353 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-14 05:30:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2024-11-14 05:30:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 3667. [2024-11-14 05:30:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 2712 states have (on average 1.8388643067846608) internal successors, (4987), 3642 states have internal predecessors, (4987), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 5037 transitions. [2024-11-14 05:30:17,730 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 5037 transitions. Word has length 27 [2024-11-14 05:30:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 3667 states and 5037 transitions. [2024-11-14 05:30:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 5037 transitions. [2024-11-14 05:30:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:30:17,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:17,732 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] [2024-11-14 05:30:17,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 05:30:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:17,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 248802845, now seen corresponding path program 1 times [2024-11-14 05:30:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:17,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386867147] [2024-11-14 05:30:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:17,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:17,936 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:17,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 05:30:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:18,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:30:18,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:18,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:30:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:18,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:18,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386867147] [2024-11-14 05:30:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386867147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:18,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:18,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936700530] [2024-11-14 05:30:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:18,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:18,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:18,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:18,414 INFO L87 Difference]: Start difference. First operand 3667 states and 5037 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:25,744 INFO L93 Difference]: Finished difference Result 4401 states and 5843 transitions. [2024-11-14 05:30:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:30:25,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-14 05:30:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:25,748 INFO L225 Difference]: With dead ends: 4401 [2024-11-14 05:30:25,749 INFO L226 Difference]: Without dead ends: 4401 [2024-11-14 05:30:25,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:25,749 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 806 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:25,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 4300 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-14 05:30:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2024-11-14 05:30:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3703. [2024-11-14 05:30:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3703 states, 2748 states have (on average 1.8296943231441047) internal successors, (5028), 3678 states have internal predecessors, (5028), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 5078 transitions. [2024-11-14 05:30:25,796 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 5078 transitions. Word has length 27 [2024-11-14 05:30:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:25,796 INFO L471 AbstractCegarLoop]: Abstraction has 3703 states and 5078 transitions. [2024-11-14 05:30:25,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 5078 transitions. [2024-11-14 05:30:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:30:25,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:25,798 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] [2024-11-14 05:30:25,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-14 05:30:26,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:26,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:26,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1699347782, now seen corresponding path program 1 times [2024-11-14 05:30:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652024431] [2024-11-14 05:30:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:26,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:26,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:26,007 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:26,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 05:30:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:26,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:30:26,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:26,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:30:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:26,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:26,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652024431] [2024-11-14 05:30:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652024431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:26,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540968522] [2024-11-14 05:30:26,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:26,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:26,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:26,393 INFO L87 Difference]: Start difference. First operand 3703 states and 5078 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:32,350 INFO L93 Difference]: Finished difference Result 4403 states and 5842 transitions. [2024-11-14 05:30:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:30:32,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-14 05:30:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:32,354 INFO L225 Difference]: With dead ends: 4403 [2024-11-14 05:30:32,354 INFO L226 Difference]: Without dead ends: 4403 [2024-11-14 05:30:32,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:32,354 INFO L432 NwaCegarLoop]: 2202 mSDtfsCounter, 1691 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:32,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4571 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-14 05:30:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2024-11-14 05:30:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3699. [2024-11-14 05:30:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 2748 states have (on average 1.826783114992722) internal successors, (5020), 3674 states have internal predecessors, (5020), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 5070 transitions. [2024-11-14 05:30:32,400 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 5070 transitions. Word has length 36 [2024-11-14 05:30:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:32,400 INFO L471 AbstractCegarLoop]: Abstraction has 3699 states and 5070 transitions. [2024-11-14 05:30:32,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 5070 transitions. [2024-11-14 05:30:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:30:32,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:32,401 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] [2024-11-14 05:30:32,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-14 05:30:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:32,602 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:32,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1699347783, now seen corresponding path program 1 times [2024-11-14 05:30:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665488799] [2024-11-14 05:30:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:32,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:32,606 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:32,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 05:30:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:32,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:30:32,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:32,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:30:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:33,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:33,207 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665488799] [2024-11-14 05:30:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665488799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531475062] [2024-11-14 05:30:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:33,209 INFO L87 Difference]: Start difference. First operand 3699 states and 5070 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:40,890 INFO L93 Difference]: Finished difference Result 5032 states and 6738 transitions. [2024-11-14 05:30:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:30:40,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-14 05:30:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:40,896 INFO L225 Difference]: With dead ends: 5032 [2024-11-14 05:30:40,896 INFO L226 Difference]: Without dead ends: 5032 [2024-11-14 05:30:40,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:40,897 INFO L432 NwaCegarLoop]: 2557 mSDtfsCounter, 1190 mSDsluCounter, 2774 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 5331 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:40,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 5331 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2840 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-14 05:30:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2024-11-14 05:30:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 3695. [2024-11-14 05:30:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 2748 states have (on average 1.8238719068413392) internal successors, (5012), 3670 states have internal predecessors, (5012), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 5062 transitions. [2024-11-14 05:30:40,944 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 5062 transitions. Word has length 36 [2024-11-14 05:30:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 3695 states and 5062 transitions. [2024-11-14 05:30:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 5062 transitions. [2024-11-14 05:30:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:30:40,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:40,945 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] [2024-11-14 05:30:40,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-14 05:30:41,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:41,149 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:41,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1176280582, now seen corresponding path program 1 times [2024-11-14 05:30:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:41,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63181437] [2024-11-14 05:30:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:41,154 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:41,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 05:30:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:41,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:30:41,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:41,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:30:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:41,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:41,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:41,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63181437] [2024-11-14 05:30:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63181437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:41,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:41,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99712667] [2024-11-14 05:30:41,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:41,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:41,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:41,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:41,548 INFO L87 Difference]: Start difference. First operand 3695 states and 5062 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:48,118 INFO L93 Difference]: Finished difference Result 4411 states and 5826 transitions. [2024-11-14 05:30:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:30:48,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-14 05:30:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:48,125 INFO L225 Difference]: With dead ends: 4411 [2024-11-14 05:30:48,125 INFO L226 Difference]: Without dead ends: 4411 [2024-11-14 05:30:48,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:48,126 INFO L432 NwaCegarLoop]: 2198 mSDtfsCounter, 1683 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 4563 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:48,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 4563 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-14 05:30:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2024-11-14 05:30:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 3691. [2024-11-14 05:30:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2748 states have (on average 1.8151382823871907) internal successors, (4988), 3666 states have internal predecessors, (4988), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5038 transitions. [2024-11-14 05:30:48,183 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5038 transitions. Word has length 36 [2024-11-14 05:30:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:48,183 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 5038 transitions. [2024-11-14 05:30:48,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5038 transitions. [2024-11-14 05:30:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:30:48,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:48,184 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] [2024-11-14 05:30:48,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-14 05:30:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:48,385 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:48,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1176280583, now seen corresponding path program 1 times [2024-11-14 05:30:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950762623] [2024-11-14 05:30:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:48,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:48,390 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:48,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 05:30:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:48,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:30:48,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:48,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:30:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:48,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:48,975 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950762623] [2024-11-14 05:30:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950762623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:48,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681816239] [2024-11-14 05:30:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:48,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:48,978 INFO L87 Difference]: Start difference. First operand 3691 states and 5038 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:58,154 INFO L93 Difference]: Finished difference Result 5020 states and 6706 transitions. [2024-11-14 05:30:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:30:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-14 05:30:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:58,162 INFO L225 Difference]: With dead ends: 5020 [2024-11-14 05:30:58,162 INFO L226 Difference]: Without dead ends: 5020 [2024-11-14 05:30:58,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:58,163 INFO L432 NwaCegarLoop]: 2552 mSDtfsCounter, 1182 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:58,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5348 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2835 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-14 05:30:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2024-11-14 05:30:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 3691. [2024-11-14 05:30:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2748 states have (on average 1.8122270742358078) internal successors, (4980), 3666 states have internal predecessors, (4980), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5030 transitions. [2024-11-14 05:30:58,209 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 5030 transitions. Word has length 36 [2024-11-14 05:30:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:58,209 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 5030 transitions. [2024-11-14 05:30:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 5030 transitions. [2024-11-14 05:30:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 05:30:58,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:58,210 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] [2024-11-14 05:30:58,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 05:30:58,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:58,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:58,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash 869933364, now seen corresponding path program 1 times [2024-11-14 05:30:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:58,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872370113] [2024-11-14 05:30:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:58,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:58,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:58,413 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:58,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-14 05:30:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:58,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:30:58,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:58,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:58,780 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872370113] [2024-11-14 05:30:58,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872370113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:58,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:58,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:58,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670651351] [2024-11-14 05:30:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:58,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:30:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:30:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:30:58,781 INFO L87 Difference]: Start difference. First operand 3691 states and 5030 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:58,912 INFO L93 Difference]: Finished difference Result 3679 states and 5006 transitions. [2024-11-14 05:30:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:30:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-14 05:30:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:58,918 INFO L225 Difference]: With dead ends: 3679 [2024-11-14 05:30:58,919 INFO L226 Difference]: Without dead ends: 3679 [2024-11-14 05:30:58,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:30:58,920 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 27 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6572 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:58,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6572 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2024-11-14 05:30:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3679. [2024-11-14 05:30:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2736 states have (on average 1.8114035087719298) internal successors, (4956), 3654 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:30:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 5006 transitions. [2024-11-14 05:30:58,972 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 5006 transitions. Word has length 41 [2024-11-14 05:30:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:58,972 INFO L471 AbstractCegarLoop]: Abstraction has 3679 states and 5006 transitions. [2024-11-14 05:30:58,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 5006 transitions. [2024-11-14 05:30:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 05:30:58,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:58,973 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] [2024-11-14 05:30:58,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-14 05:30:59,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:59,174 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:30:59,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1703822208, now seen corresponding path program 1 times [2024-11-14 05:30:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:30:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872591217] [2024-11-14 05:30:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:30:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:30:59,180 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:30:59,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-14 05:30:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:59,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:30:59,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:59,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:59,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:30:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872591217] [2024-11-14 05:30:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872591217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:30:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128037681] [2024-11-14 05:30:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:59,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:30:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:59,929 INFO L87 Difference]: Start difference. First operand 3679 states and 5006 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:00,429 INFO L93 Difference]: Finished difference Result 5509 states and 7251 transitions. [2024-11-14 05:31:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:31:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-14 05:31:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:00,438 INFO L225 Difference]: With dead ends: 5509 [2024-11-14 05:31:00,439 INFO L226 Difference]: Without dead ends: 5509 [2024-11-14 05:31:00,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:31:00,439 INFO L432 NwaCegarLoop]: 2290 mSDtfsCounter, 1486 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:00,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 4407 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:31:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2024-11-14 05:31:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 4733. [2024-11-14 05:31:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4733 states, 3783 states have (on average 1.795929156753899) internal successors, (6794), 4698 states have internal predecessors, (6794), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 05:31:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 6864 transitions. [2024-11-14 05:31:00,541 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 6864 transitions. Word has length 49 [2024-11-14 05:31:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:00,541 INFO L471 AbstractCegarLoop]: Abstraction has 4733 states and 6864 transitions. [2024-11-14 05:31:00,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 6864 transitions. [2024-11-14 05:31:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 05:31:00,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:00,542 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] [2024-11-14 05:31:00,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-14 05:31:00,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:00,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:00,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1865308578, now seen corresponding path program 1 times [2024-11-14 05:31:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:00,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181697610] [2024-11-14 05:31:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:00,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:00,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:00,750 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:00,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-14 05:31:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:01,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:31:01,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:01,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:01,154 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181697610] [2024-11-14 05:31:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181697610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677486374] [2024-11-14 05:31:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:01,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:31:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:31:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:01,155 INFO L87 Difference]: Start difference. First operand 4733 states and 6864 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:01,241 INFO L93 Difference]: Finished difference Result 4691 states and 6794 transitions. [2024-11-14 05:31:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:31:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2024-11-14 05:31:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:01,247 INFO L225 Difference]: With dead ends: 4691 [2024-11-14 05:31:01,247 INFO L226 Difference]: Without dead ends: 4691 [2024-11-14 05:31:01,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:01,248 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 27 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6560 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:01,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6560 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:31:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2024-11-14 05:31:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4691. [2024-11-14 05:31:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4691 states, 3741 states have (on average 1.797380379577653) internal successors, (6724), 4656 states have internal predecessors, (6724), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 05:31:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 6794 transitions. [2024-11-14 05:31:01,308 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 6794 transitions. Word has length 52 [2024-11-14 05:31:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:01,308 INFO L471 AbstractCegarLoop]: Abstraction has 4691 states and 6794 transitions. [2024-11-14 05:31:01,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 6794 transitions. [2024-11-14 05:31:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 05:31:01,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:01,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:01,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-14 05:31:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:01,510 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:01,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1879659705, now seen corresponding path program 1 times [2024-11-14 05:31:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:01,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965780687] [2024-11-14 05:31:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:01,513 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:01,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-14 05:31:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:01,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:31:01,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:01,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:01,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965780687] [2024-11-14 05:31:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965780687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:01,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:01,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206104609] [2024-11-14 05:31:01,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:01,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:31:01,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:01,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:31:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:01,921 INFO L87 Difference]: Start difference. First operand 4691 states and 6794 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:02,008 INFO L93 Difference]: Finished difference Result 4673 states and 6764 transitions. [2024-11-14 05:31:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:31:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-14 05:31:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:02,016 INFO L225 Difference]: With dead ends: 4673 [2024-11-14 05:31:02,017 INFO L226 Difference]: Without dead ends: 4673 [2024-11-14 05:31:02,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:02,018 INFO L432 NwaCegarLoop]: 2195 mSDtfsCounter, 21 mSDsluCounter, 4359 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6554 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:02,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6554 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:31:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2024-11-14 05:31:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4673. [2024-11-14 05:31:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4673 states, 3723 states have (on average 1.7980123556271823) internal successors, (6694), 4638 states have internal predecessors, (6694), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 05:31:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 6764 transitions. [2024-11-14 05:31:02,083 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 6764 transitions. Word has length 55 [2024-11-14 05:31:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:02,083 INFO L471 AbstractCegarLoop]: Abstraction has 4673 states and 6764 transitions. [2024-11-14 05:31:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 6764 transitions. [2024-11-14 05:31:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:31:02,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:02,084 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] [2024-11-14 05:31:02,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-14 05:31:02,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:02,285 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:02,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash -254213192, now seen corresponding path program 1 times [2024-11-14 05:31:02,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942012693] [2024-11-14 05:31:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:02,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:02,287 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:02,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 05:31:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:02,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:31:02,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:02,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:02,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:02,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-14 05:31:02,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:02,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-14 05:31:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:02,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:02,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:02,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942012693] [2024-11-14 05:31:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942012693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949760312] [2024-11-14 05:31:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:31:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:31:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:02,702 INFO L87 Difference]: Start difference. First operand 4673 states and 6764 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:05,324 INFO L93 Difference]: Finished difference Result 4642 states and 6732 transitions. [2024-11-14 05:31:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:31:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-14 05:31:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:05,332 INFO L225 Difference]: With dead ends: 4642 [2024-11-14 05:31:05,332 INFO L226 Difference]: Without dead ends: 4642 [2024-11-14 05:31:05,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:05,334 INFO L432 NwaCegarLoop]: 2088 mSDtfsCounter, 788 mSDsluCounter, 3302 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:05,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 5390 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:31:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2024-11-14 05:31:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 4639. [2024-11-14 05:31:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 3689 states have (on average 1.8050962320412036) internal successors, (6659), 4604 states have internal predecessors, (6659), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-14 05:31:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 6729 transitions. [2024-11-14 05:31:05,380 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 6729 transitions. Word has length 60 [2024-11-14 05:31:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:05,380 INFO L471 AbstractCegarLoop]: Abstraction has 4639 states and 6729 transitions. [2024-11-14 05:31:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 6729 transitions. [2024-11-14 05:31:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:31:05,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:05,381 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] [2024-11-14 05:31:05,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-14 05:31:05,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:05,582 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:05,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1843186858, now seen corresponding path program 1 times [2024-11-14 05:31:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878450118] [2024-11-14 05:31:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:05,584 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:05,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-14 05:31:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:06,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:31:06,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:06,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:06,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:06,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878450118] [2024-11-14 05:31:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878450118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:31:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726763031] [2024-11-14 05:31:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:31:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:31:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:31:06,444 INFO L87 Difference]: Start difference. First operand 4639 states and 6729 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:06,766 INFO L93 Difference]: Finished difference Result 6466 states and 9031 transitions. [2024-11-14 05:31:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:31:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-14 05:31:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:06,777 INFO L225 Difference]: With dead ends: 6466 [2024-11-14 05:31:06,778 INFO L226 Difference]: Without dead ends: 6466 [2024-11-14 05:31:06,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:31:06,779 INFO L432 NwaCegarLoop]: 2291 mSDtfsCounter, 1196 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:06,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 4439 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:31:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6466 states. [2024-11-14 05:31:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6466 to 5739. [2024-11-14 05:31:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5739 states, 4781 states have (on average 1.780798996025936) internal successors, (8514), 5693 states have internal predecessors, (8514), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 05:31:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 8606 transitions. [2024-11-14 05:31:06,860 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 8606 transitions. Word has length 60 [2024-11-14 05:31:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 5739 states and 8606 transitions. [2024-11-14 05:31:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 8606 transitions. [2024-11-14 05:31:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:31:06,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:06,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:06,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-14 05:31:07,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:07,063 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:07,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 204896891, now seen corresponding path program 1 times [2024-11-14 05:31:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974166124] [2024-11-14 05:31:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:07,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:07,069 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:07,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-14 05:31:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:07,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:31:07,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:07,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:31:07,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 5 [2024-11-14 05:31:08,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:08,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:31:08,404 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:31:08,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:31:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:08,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:08,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974166124] [2024-11-14 05:31:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974166124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:31:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444354359] [2024-11-14 05:31:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:31:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:31:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:08,423 INFO L87 Difference]: Start difference. First operand 5739 states and 8606 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:13,616 INFO L93 Difference]: Finished difference Result 5655 states and 8325 transitions. [2024-11-14 05:31:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:31:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-14 05:31:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:13,623 INFO L225 Difference]: With dead ends: 5655 [2024-11-14 05:31:13,623 INFO L226 Difference]: Without dead ends: 5655 [2024-11-14 05:31:13,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:13,624 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 3212 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:13,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 1283 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-14 05:31:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2024-11-14 05:31:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 5478. [2024-11-14 05:31:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 4604 states have (on average 1.716550825369244) internal successors, (7903), 5432 states have internal predecessors, (7903), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 05:31:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 7995 transitions. [2024-11-14 05:31:13,696 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 7995 transitions. Word has length 63 [2024-11-14 05:31:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:13,696 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 7995 transitions. [2024-11-14 05:31:13,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 7995 transitions. [2024-11-14 05:31:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 05:31:13,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:13,697 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] [2024-11-14 05:31:13,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-14 05:31:13,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:13,902 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash 907320125, now seen corresponding path program 1 times [2024-11-14 05:31:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:13,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891914710] [2024-11-14 05:31:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:13,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:13,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:13,904 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:13,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-14 05:31:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:14,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:31:14,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:14,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:31:14,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:31:14,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:31:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:14,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:14,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891914710] [2024-11-14 05:31:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891914710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172789286] [2024-11-14 05:31:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:14,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:31:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:31:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:14,409 INFO L87 Difference]: Start difference. First operand 5478 states and 7995 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:20,757 INFO L93 Difference]: Finished difference Result 5477 states and 7992 transitions. [2024-11-14 05:31:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-14 05:31:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:20,763 INFO L225 Difference]: With dead ends: 5477 [2024-11-14 05:31:20,763 INFO L226 Difference]: Without dead ends: 5477 [2024-11-14 05:31:20,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:31:20,764 INFO L432 NwaCegarLoop]: 2122 mSDtfsCounter, 2 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:20,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5653 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 05:31:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-11-14 05:31:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-11-14 05:31:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 4604 states have (on average 1.7158992180712425) internal successors, (7900), 5431 states have internal predecessors, (7900), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 05:31:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 7992 transitions. [2024-11-14 05:31:20,821 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 7992 transitions. Word has length 68 [2024-11-14 05:31:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:20,821 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 7992 transitions. [2024-11-14 05:31:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 7992 transitions. [2024-11-14 05:31:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 05:31:20,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:20,823 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] [2024-11-14 05:31:20,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-14 05:31:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:21,023 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 907320126, now seen corresponding path program 1 times [2024-11-14 05:31:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507290499] [2024-11-14 05:31:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:21,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:21,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:21,026 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:21,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-14 05:31:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:21,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:31:21,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:21,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:31:21,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:31:21,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:31:21,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 05:31:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:21,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:21,522 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507290499] [2024-11-14 05:31:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507290499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036665109] [2024-11-14 05:31:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:31:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:31:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:21,524 INFO L87 Difference]: Start difference. First operand 5477 states and 7992 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:29,888 INFO L93 Difference]: Finished difference Result 5476 states and 7989 transitions. [2024-11-14 05:31:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:29,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-14 05:31:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:29,894 INFO L225 Difference]: With dead ends: 5476 [2024-11-14 05:31:29,894 INFO L226 Difference]: Without dead ends: 5476 [2024-11-14 05:31:29,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:31:29,895 INFO L432 NwaCegarLoop]: 2122 mSDtfsCounter, 1 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:29,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5631 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-14 05:31:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2024-11-14 05:31:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5476. [2024-11-14 05:31:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 4601 states have (on average 1.7163660073896978) internal successors, (7897), 5430 states have internal predecessors, (7897), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 05:31:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7989 transitions. [2024-11-14 05:31:29,956 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7989 transitions. Word has length 68 [2024-11-14 05:31:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:29,956 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 7989 transitions. [2024-11-14 05:31:29,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7989 transitions. [2024-11-14 05:31:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 05:31:29,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:29,957 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] [2024-11-14 05:31:29,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-14 05:31:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:30,158 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr386REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1941921789, now seen corresponding path program 1 times [2024-11-14 05:31:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978187131] [2024-11-14 05:31:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:30,160 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:30,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-14 05:31:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:30,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:31:30,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:30,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:31:30,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:31:30,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:31:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:30,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:30,611 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978187131] [2024-11-14 05:31:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978187131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63921684] [2024-11-14 05:31:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:30,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:31:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:31:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:30,612 INFO L87 Difference]: Start difference. First operand 5476 states and 7989 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:37,191 INFO L93 Difference]: Finished difference Result 5475 states and 7985 transitions. [2024-11-14 05:31:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-14 05:31:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:37,197 INFO L225 Difference]: With dead ends: 5475 [2024-11-14 05:31:37,198 INFO L226 Difference]: Without dead ends: 5475 [2024-11-14 05:31:37,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:31:37,198 INFO L432 NwaCegarLoop]: 2120 mSDtfsCounter, 2 mSDsluCounter, 3528 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5648 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:37,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5648 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-14 05:31:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2024-11-14 05:31:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5475. [2024-11-14 05:31:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5475 states, 4601 states have (on average 1.7154966311671376) internal successors, (7893), 5429 states have internal predecessors, (7893), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 05:31:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 7985 transitions. [2024-11-14 05:31:37,260 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 7985 transitions. Word has length 68 [2024-11-14 05:31:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:37,260 INFO L471 AbstractCegarLoop]: Abstraction has 5475 states and 7985 transitions. [2024-11-14 05:31:37,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 7985 transitions. [2024-11-14 05:31:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 05:31:37,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:37,262 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] [2024-11-14 05:31:37,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-14 05:31:37,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:37,462 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr387REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:37,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1941921790, now seen corresponding path program 1 times [2024-11-14 05:31:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367374041] [2024-11-14 05:31:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:37,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:37,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:37,467 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:37,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-14 05:31:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:37,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:31:37,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:31:37,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:31:37,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:31:38,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 05:31:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:38,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:38,050 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367374041] [2024-11-14 05:31:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367374041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876107193] [2024-11-14 05:31:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:31:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:31:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:38,051 INFO L87 Difference]: Start difference. First operand 5475 states and 7985 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:46,216 INFO L93 Difference]: Finished difference Result 5474 states and 7981 transitions. [2024-11-14 05:31:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:46,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-14 05:31:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:46,223 INFO L225 Difference]: With dead ends: 5474 [2024-11-14 05:31:46,223 INFO L226 Difference]: Without dead ends: 5474 [2024-11-14 05:31:46,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:31:46,223 INFO L432 NwaCegarLoop]: 2120 mSDtfsCounter, 1 mSDsluCounter, 3506 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5626 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:46,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5626 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-14 05:31:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2024-11-14 05:31:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 5474. [2024-11-14 05:31:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5474 states, 4597 states have (on average 1.7161192081792473) internal successors, (7889), 5428 states have internal predecessors, (7889), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 05:31:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 7981 transitions. [2024-11-14 05:31:46,296 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 7981 transitions. Word has length 68 [2024-11-14 05:31:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:46,296 INFO L471 AbstractCegarLoop]: Abstraction has 5474 states and 7981 transitions. [2024-11-14 05:31:46,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 7981 transitions. [2024-11-14 05:31:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-14 05:31:46,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:46,297 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, 1] [2024-11-14 05:31:46,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-14 05:31:46,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:46,498 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:46,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -692729051, now seen corresponding path program 1 times [2024-11-14 05:31:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:46,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485502300] [2024-11-14 05:31:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:46,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:46,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:46,501 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:46,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-14 05:31:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:46,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:31:46,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:46,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:46,924 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485502300] [2024-11-14 05:31:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485502300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:46,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663111185] [2024-11-14 05:31:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:31:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:31:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:46,927 INFO L87 Difference]: Start difference. First operand 5474 states and 7981 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:31:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:47,032 INFO L93 Difference]: Finished difference Result 5477 states and 7990 transitions. [2024-11-14 05:31:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:31:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 76 [2024-11-14 05:31:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:47,061 INFO L225 Difference]: With dead ends: 5477 [2024-11-14 05:31:47,061 INFO L226 Difference]: Without dead ends: 5477 [2024-11-14 05:31:47,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:31:47,061 INFO L432 NwaCegarLoop]: 2119 mSDtfsCounter, 0 mSDsluCounter, 4230 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6349 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:47,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6349 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:31:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-11-14 05:31:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-11-14 05:31:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 4599 states have (on average 1.7160252228745378) internal successors, (7892), 5431 states have internal predecessors, (7892), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-14 05:31:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 7990 transitions. [2024-11-14 05:31:47,163 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 7990 transitions. Word has length 76 [2024-11-14 05:31:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:47,164 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 7990 transitions. [2024-11-14 05:31:47,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:31:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 7990 transitions. [2024-11-14 05:31:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-14 05:31:47,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:47,165 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, 1, 1] [2024-11-14 05:31:47,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-14 05:31:47,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:47,365 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1058567970, now seen corresponding path program 1 times [2024-11-14 05:31:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348604579] [2024-11-14 05:31:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:47,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:47,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:47,368 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:47,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-14 05:31:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:47,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:31:47,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:47,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:48,009 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348604579] [2024-11-14 05:31:48,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348604579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745615315] [2024-11-14 05:31:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:31:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:31:48,020 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:31:48,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-14 05:31:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:48,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:31:48,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:48,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [745615315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:48,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575857090] [2024-11-14 05:31:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:48,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:48,861 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:48,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 05:31:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:49,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:31:49,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:49,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575857090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:49,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:31:49,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-14 05:31:49,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916709993] [2024-11-14 05:31:49,427 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:49,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:31:49,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:49,429 INFO L87 Difference]: Start difference. First operand 5477 states and 7990 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:31:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:49,788 INFO L93 Difference]: Finished difference Result 5489 states and 8012 transitions. [2024-11-14 05:31:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:31:49,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 77 [2024-11-14 05:31:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:49,807 INFO L225 Difference]: With dead ends: 5489 [2024-11-14 05:31:49,807 INFO L226 Difference]: Without dead ends: 5489 [2024-11-14 05:31:49,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:31:49,808 INFO L432 NwaCegarLoop]: 2118 mSDtfsCounter, 5 mSDsluCounter, 12671 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14789 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:49,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14789 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:31:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2024-11-14 05:31:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5487. [2024-11-14 05:31:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5487 states, 4608 states have (on average 1.7159288194444444) internal successors, (7907), 5440 states have internal predecessors, (7907), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-14 05:31:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8005 transitions. [2024-11-14 05:31:49,904 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 8005 transitions. Word has length 77 [2024-11-14 05:31:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 5487 states and 8005 transitions. [2024-11-14 05:31:49,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:31:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 8005 transitions. [2024-11-14 05:31:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-14 05:31:49,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:49,906 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, 1, 1] [2024-11-14 05:31:49,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 05:31:50,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-14 05:31:50,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-14 05:31:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:31:50,507 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:31:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1273761435, now seen corresponding path program 2 times [2024-11-14 05:31:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:31:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939813540] [2024-11-14 05:31:50,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:31:50,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:31:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:31:50,510 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:31:50,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-14 05:31:51,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:31:51,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:31:51,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:31:51,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:51,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:51,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:31:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939813540] [2024-11-14 05:31:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939813540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697403744] [2024-11-14 05:31:51,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:31:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:31:51,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:31:51,489 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:31:51,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-14 05:31:53,422 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:31:53,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:31:53,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:31:53,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:53,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:53,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [697403744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322699904] [2024-11-14 05:31:53,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:31:53,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:53,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:53,555 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:53,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 05:32:10,720 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:32:10,720 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:32:10,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:32:10,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:10,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:32:10,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:32:10,950 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:32:10,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:32:11,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:32:11,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:32:11,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:32:11,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:32:11,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:32:11,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 62 treesize of output 57 [2024-11-14 05:32:11,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:32:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:32:11,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:32:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:32:11,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:12,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2344 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_2344) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2344 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_2344) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_2343) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:32:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322699904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:32:12,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 05:32:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 21 [2024-11-14 05:32:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527611694] [2024-11-14 05:32:12,149 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 05:32:12,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:32:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:32:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:32:12,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2024-11-14 05:32:12,151 INFO L87 Difference]: Start difference. First operand 5487 states and 8005 transitions. Second operand has 21 states, 20 states have (on average 7.85) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:32:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:47,020 INFO L93 Difference]: Finished difference Result 5526 states and 8059 transitions. [2024-11-14 05:32:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 05:32:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.85) internal successors, (157), 21 states have internal predecessors, (157), 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 80 [2024-11-14 05:32:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:47,033 INFO L225 Difference]: With dead ends: 5526 [2024-11-14 05:32:47,033 INFO L226 Difference]: Without dead ends: 5512 [2024-11-14 05:32:47,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=432, Invalid=1923, Unknown=1, NotChecked=94, Total=2450 [2024-11-14 05:32:47,035 INFO L432 NwaCegarLoop]: 1381 mSDtfsCounter, 1615 mSDsluCounter, 16220 mSDsCounter, 0 mSdLazyCounter, 14955 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 17601 SdHoareTripleChecker+Invalid, 14995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 14955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:47,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 17601 Invalid, 14995 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [40 Valid, 14955 Invalid, 0 Unknown, 0 Unchecked, 32.9s Time] [2024-11-14 05:32:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2024-11-14 05:32:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 5510. [2024-11-14 05:32:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5510 states, 4631 states have (on average 1.7125890736342042) internal successors, (7931), 5462 states have internal predecessors, (7931), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-14 05:32:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5510 states to 5510 states and 8029 transitions. [2024-11-14 05:32:47,111 INFO L78 Accepts]: Start accepts. Automaton has 5510 states and 8029 transitions. Word has length 80 [2024-11-14 05:32:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:47,111 INFO L471 AbstractCegarLoop]: Abstraction has 5510 states and 8029 transitions. [2024-11-14 05:32:47,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.85) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:32:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5510 states and 8029 transitions. [2024-11-14 05:32:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-14 05:32:47,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:47,112 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, 1, 1] [2024-11-14 05:32:47,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-14 05:32:47,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2024-11-14 05:32:47,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2024-11-14 05:32:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:32:47,714 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:32:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1620283076, now seen corresponding path program 1 times [2024-11-14 05:32:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:32:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680796624] [2024-11-14 05:32:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:47,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:32:47,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:32:47,716 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:32:47,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-11-14 05:32:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:48,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:32:48,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:48,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:48,957 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:32:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680796624] [2024-11-14 05:32:48,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680796624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:32:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1763483739] [2024-11-14 05:32:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:48,957 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:32:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:32:48,961 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:32:48,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-14 05:32:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:49,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:32:49,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:49,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1763483739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:32:50,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258285933] [2024-11-14 05:32:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:50,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:32:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:32:50,089 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:32:50,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 05:32:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:50,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:32:50,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:50,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258285933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:32:51,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:32:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-14 05:32:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422866245] [2024-11-14 05:32:51,709 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:32:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 05:32:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:32:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 05:32:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:32:51,711 INFO L87 Difference]: Start difference. First operand 5510 states and 8029 transitions. Second operand has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 38 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 05:32:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:54,167 INFO L93 Difference]: Finished difference Result 5552 states and 8101 transitions. [2024-11-14 05:32:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 05:32:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 38 states have internal predecessors, (111), 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 86 [2024-11-14 05:32:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:54,178 INFO L225 Difference]: With dead ends: 5552 [2024-11-14 05:32:54,178 INFO L226 Difference]: Without dead ends: 5542 [2024-11-14 05:32:54,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 05:32:54,180 INFO L432 NwaCegarLoop]: 2118 mSDtfsCounter, 20 mSDsluCounter, 23260 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25378 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:54,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25378 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:32:54,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2024-11-14 05:32:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 5540. [2024-11-14 05:32:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5540 states, 4661 states have (on average 1.7090753057283845) internal successors, (7966), 5492 states have internal predecessors, (7966), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-14 05:32:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5540 states to 5540 states and 8064 transitions. [2024-11-14 05:32:54,247 INFO L78 Accepts]: Start accepts. Automaton has 5540 states and 8064 transitions. Word has length 86 [2024-11-14 05:32:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:54,248 INFO L471 AbstractCegarLoop]: Abstraction has 5540 states and 8064 transitions. [2024-11-14 05:32:54,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 38 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 05:32:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5540 states and 8064 transitions. [2024-11-14 05:32:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-14 05:32:54,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:54,249 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, 1, 1] [2024-11-14 05:32:54,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-14 05:32:54,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2024-11-14 05:32:54,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-11-14 05:32:54,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:32:54,857 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:32:54,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash 748564868, now seen corresponding path program 2 times [2024-11-14 05:32:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:32:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607894010] [2024-11-14 05:32:54,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:32:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:32:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:32:54,859 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:32:54,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2024-11-14 05:32:55,608 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:32:55,608 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:32:55,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:32:55,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:56,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:58,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:32:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607894010] [2024-11-14 05:32:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607894010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:32:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [229636985] [2024-11-14 05:32:58,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:32:58,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:32:58,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:32:58,044 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:32:58,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-14 05:33:00,181 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:33:00,181 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:33:00,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:33:00,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:33:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:33:00,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:33:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:33:00,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [229636985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:33:00,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654193144] [2024-11-14 05:33:00,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:33:00,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:33:00,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:33:00,663 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:33:00,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 05:33:33,433 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:33:33,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:33:33,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 05:33:33,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:33:33,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:33:33,717 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:33:33,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:33:33,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:33:34,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:33:34,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:33:34,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 33 treesize of output 15 [2024-11-14 05:33:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-14 05:33:35,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:33:35,471 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 05:33:35,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-14 05:33:35,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem37#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-14 05:33:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654193144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:33:35,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 05:33:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 10] total 59 [2024-11-14 05:33:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185627918] [2024-11-14 05:33:35,487 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 05:33:35,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-14 05:33:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:33:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-14 05:33:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-14 05:33:35,490 INFO L87 Difference]: Start difference. First operand 5540 states and 8064 transitions. Second operand has 59 states, 58 states have (on average 3.3275862068965516) internal successors, (193), 58 states have internal predecessors, (193), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:34:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:45,313 INFO L93 Difference]: Finished difference Result 5607 states and 8191 transitions. [2024-11-14 05:34:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-14 05:34:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.3275862068965516) internal successors, (193), 58 states have internal predecessors, (193), 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 98 [2024-11-14 05:34:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:45,321 INFO L225 Difference]: With dead ends: 5607 [2024-11-14 05:34:45,321 INFO L226 Difference]: Without dead ends: 5599 [2024-11-14 05:34:45,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3459 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3757, Invalid=15152, Unknown=1, NotChecked=272, Total=19182 [2024-11-14 05:34:45,326 INFO L432 NwaCegarLoop]: 1355 mSDtfsCounter, 1656 mSDsluCounter, 39726 mSDsCounter, 0 mSdLazyCounter, 27379 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 41081 SdHoareTripleChecker+Invalid, 27451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 27379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:45,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 41081 Invalid, 27451 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [72 Valid, 27379 Invalid, 0 Unknown, 0 Unchecked, 58.7s Time] [2024-11-14 05:34:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5599 states. [2024-11-14 05:34:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5599 to 5595. [2024-11-14 05:34:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5595 states, 4717 states have (on average 1.702565189739241) internal successors, (8031), 5547 states have internal predecessors, (8031), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-14 05:34:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5595 states to 5595 states and 8129 transitions. [2024-11-14 05:34:45,420 INFO L78 Accepts]: Start accepts. Automaton has 5595 states and 8129 transitions. Word has length 98 [2024-11-14 05:34:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 5595 states and 8129 transitions. [2024-11-14 05:34:45,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.3275862068965516) internal successors, (193), 58 states have internal predecessors, (193), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:34:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5595 states and 8129 transitions. [2024-11-14 05:34:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-14 05:34:45,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:45,423 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] [2024-11-14 05:34:45,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2024-11-14 05:34:45,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2024-11-14 05:34:45,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 05:34:46,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:34:46,024 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr390REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:34:46,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 357816996, now seen corresponding path program 1 times [2024-11-14 05:34:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754997943] [2024-11-14 05:34:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:46,028 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:46,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2024-11-14 05:34:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:47,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:34:47,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:47,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:34:47,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:47,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:47,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:47,082 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-14 05:34:47,195 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:34:47,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:34:47,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2024-11-14 05:34:47,437 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 47 treesize of output 36 [2024-11-14 05:34:47,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:47,507 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-14 05:34:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2024-11-14 05:34:47,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:34:47,531 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754997943] [2024-11-14 05:34:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754997943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:34:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:34:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:34:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500783399] [2024-11-14 05:34:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:34:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:34:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:47,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:34:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:34:47,532 INFO L87 Difference]: Start difference. First operand 5595 states and 8129 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:34:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:59,388 INFO L93 Difference]: Finished difference Result 5762 states and 8057 transitions. [2024-11-14 05:34:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:34:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 120 [2024-11-14 05:34:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:59,397 INFO L225 Difference]: With dead ends: 5762 [2024-11-14 05:34:59,397 INFO L226 Difference]: Without dead ends: 5762 [2024-11-14 05:34:59,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:34:59,398 INFO L432 NwaCegarLoop]: 1422 mSDtfsCounter, 2001 mSDsluCounter, 4491 mSDsCounter, 0 mSdLazyCounter, 4270 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 5913 SdHoareTripleChecker+Invalid, 4296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:59,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 5913 Invalid, 4296 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 4270 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-11-14 05:34:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2024-11-14 05:34:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5191. [2024-11-14 05:34:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4314 states have (on average 1.7262401483541956) internal successors, (7447), 5146 states have internal predecessors, (7447), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-14 05:34:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7538 transitions. [2024-11-14 05:34:59,472 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7538 transitions. Word has length 120 [2024-11-14 05:34:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:59,472 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7538 transitions. [2024-11-14 05:34:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:34:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7538 transitions. [2024-11-14 05:34:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 05:34:59,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:59,473 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] [2024-11-14 05:34:59,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2024-11-14 05:34:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:59,674 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:34:59,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash 618568354, now seen corresponding path program 1 times [2024-11-14 05:34:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:59,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667744772] [2024-11-14 05:34:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:59,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:59,677 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:59,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2024-11-14 05:35:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:00,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 05:35:00,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:00,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:35:00,997 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:35:00,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:35:01,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:35:01,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 05:35:02,422 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:02,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:35:02,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:02,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:35:02,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:35:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:35:02,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:02,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4395 (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_4395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:35:03,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_4441))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4395)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:35:03,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:35:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667744772] [2024-11-14 05:35:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667744772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1398598895] [2024-11-14 05:35:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:35:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:35:03,291 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:35:03,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2024-11-14 05:35:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:07,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 05:35:07,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:07,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:35:07,650 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:35:07,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:35:07,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:35:07,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 05:35:09,039 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:35:09,119 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:09,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:35:09,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:35:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:35:09,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:09,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4864 (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_4864) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 05:35:09,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4864 (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_4864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:35:09,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_4910))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4864)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:35:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1398598895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156189021] [2024-11-14 05:35:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:09,785 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:09,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-14 05:35:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:10,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-14 05:35:10,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:10,798 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:35:10,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:35:10,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:35:11,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:35:11,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:11,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-14 05:35:11,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:35:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:35:11,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:11,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5331 (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_5331) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 05:35:11,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5331 (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_5331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:35:12,550 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-14 05:35:12,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2024-11-14 05:35:12,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem37#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~mem37#1.base| v_ArrVal_5377))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-14 05:35:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156189021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:12,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:35:12,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-14 05:35:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620513158] [2024-11-14 05:35:12,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:12,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:35:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:35:12,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:35:12,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=348, Unknown=18, NotChecked=360, Total=812 [2024-11-14 05:35:12,566 INFO L87 Difference]: Start difference. First operand 5191 states and 7538 transitions. Second operand has 19 states, 16 states have (on average 6.3125) internal successors, (101), 18 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-14 05:35:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:35,513 INFO L93 Difference]: Finished difference Result 5192 states and 7541 transitions. [2024-11-14 05:35:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:35:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 18 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 123 [2024-11-14 05:35:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:35,522 INFO L225 Difference]: With dead ends: 5192 [2024-11-14 05:35:35,522 INFO L226 Difference]: Without dead ends: 5192 [2024-11-14 05:35:35,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 357 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=458, Unknown=19, NotChecked=408, Total=992 [2024-11-14 05:35:35,523 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 1615 mSDsluCounter, 10811 mSDsCounter, 0 mSdLazyCounter, 9528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 12165 SdHoareTripleChecker+Invalid, 9547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 9528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:35,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 12165 Invalid, 9547 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 9528 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2024-11-14 05:35:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2024-11-14 05:35:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5190. [2024-11-14 05:35:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4314 states have (on average 1.7255447380621234) internal successors, (7444), 5145 states have internal predecessors, (7444), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-14 05:35:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7535 transitions. [2024-11-14 05:35:35,586 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7535 transitions. Word has length 123 [2024-11-14 05:35:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:35,587 INFO L471 AbstractCegarLoop]: Abstraction has 5190 states and 7535 transitions. [2024-11-14 05:35:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 18 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-14 05:35:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7535 transitions. [2024-11-14 05:35:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-14 05:35:35,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:35,588 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] [2024-11-14 05:35:35,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2024-11-14 05:35:35,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2024-11-14 05:35:36,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2024-11-14 05:35:36,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:35:36,189 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:35:36,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 618568355, now seen corresponding path program 1 times [2024-11-14 05:35:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:35:36,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130110160] [2024-11-14 05:35:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:35:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:35:36,192 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:35:36,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2024-11-14 05:35:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:37,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-14 05:35:37,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:37,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:35:37,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:35:37,679 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:35:37,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:35:37,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:35:37,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:35:37,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:35:37,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:35:38,881 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:38,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:35:38,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:35:39,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:35:39,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:35:39,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:35:39,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:35:39,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:35:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:35:39,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:39,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5846) |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_5847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-14 05:35:39,355 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_5847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-14 05:35:40,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5938))) (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~mem37#1.base| v_ArrVal_5939) .cse0 v_ArrVal_5846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5939) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2024-11-14 05:35:40,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:35:40,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130110160] [2024-11-14 05:35:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130110160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:40,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461731119] [2024-11-14 05:35:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:40,998 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:35:40,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:35:41,000 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:35:41,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2024-11-14 05:37:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:22,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-14 05:37:22,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:22,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:37:22,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:37:22,805 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:37:22,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:37:22,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:37:22,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:37:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:37:22,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:37:23,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:23,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:37:23,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:37:23,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:23,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:37:23,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:37:23,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:37:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:37:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:37:23,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:24,015 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-14 05:37:24,045 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_6408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:37:25,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6500))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6501) .cse0 v_ArrVal_6408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6501) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-14 05:37:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461731119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796325604] [2024-11-14 05:37:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:25,679 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:25,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-14 05:37:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:26,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-14 05:37:26,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:26,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:37:26,772 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:37:26,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:37:26,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:37:26,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:37:26,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:37:26,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:37:26,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:37:27,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:27,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:37:27,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:37:27,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:27,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:37:27,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:37:27,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:37:27,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:37:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:37:27,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:27,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:37:27,993 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_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:37:29,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7062) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7063))) (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~mem37#1.base| v_ArrVal_7062) .cse2 v_ArrVal_6971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:37:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796325604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:29,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:37:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-14 05:37:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962321724] [2024-11-14 05:37:29,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:37:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:37:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:37:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:37:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=113, Unknown=9, NotChecked=252, Total=420 [2024-11-14 05:37:29,731 INFO L87 Difference]: Start difference. First operand 5190 states and 7535 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:37:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:46,577 INFO L93 Difference]: Finished difference Result 5189 states and 7532 transitions. [2024-11-14 05:37:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:37:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 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 123 [2024-11-14 05:37:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:46,587 INFO L225 Difference]: With dead ends: 5189 [2024-11-14 05:37:46,587 INFO L226 Difference]: Without dead ends: 5189 [2024-11-14 05:37:46,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 363 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=222, Unknown=9, NotChecked=342, Total=650 [2024-11-14 05:37:46,588 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 1597 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 6110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 6120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:46,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 4952 Invalid, 6120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6110 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2024-11-14 05:37:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2024-11-14 05:37:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5189. [2024-11-14 05:37:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 4314 states have (on average 1.724849327770051) internal successors, (7441), 5144 states have internal predecessors, (7441), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-14 05:37:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 7532 transitions. [2024-11-14 05:37:46,655 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 7532 transitions. Word has length 123 [2024-11-14 05:37:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:46,655 INFO L471 AbstractCegarLoop]: Abstraction has 5189 states and 7532 transitions. [2024-11-14 05:37:46,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:37:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 7532 transitions. [2024-11-14 05:37:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 05:37:46,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:46,657 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] [2024-11-14 05:37:46,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2024-11-14 05:37:46,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (48)] Ended with exit code 0 [2024-11-14 05:37:47,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2024-11-14 05:37:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:47,258 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:37:47,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1934505397, now seen corresponding path program 1 times [2024-11-14 05:37:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:37:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987786940] [2024-11-14 05:37:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:47,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:37:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:37:47,260 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:37:47,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2024-11-14 05:37:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:48,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 05:37:48,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:48,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:37:48,647 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:37:48,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:37:48,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:37:48,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 05:37:49,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:49,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:37:50,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:50,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:37:50,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:37:50,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:37:50,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:37:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:37:50,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:50,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7502 (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_7502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:37:50,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (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_7501))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:37:50,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (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_7501))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:37:50,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7548))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7501)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:37:50,942 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:37:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987786940] [2024-11-14 05:37:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987786940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1052690675] [2024-11-14 05:37:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:50,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:37:50,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:37:50,945 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:37:50,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2024-11-14 05:38:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:35,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 05:38:35,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:35,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:38:35,903 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:38:35,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:38:35,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:38:36,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 05:38:37,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:37,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:38:37,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:37,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:38:37,350 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:37,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:38:37,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:38:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:38:37,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:37,430 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7987 (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_7987) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 05:38:37,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7987 (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_7987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:38:37,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7986 (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_7986))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7987)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:38:37,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7986 (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_7986))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7987)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:38:37,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8033 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8033))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7986)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7987)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:38:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1052690675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:37,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133933777] [2024-11-14 05:38:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:37,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:37,974 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:37,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-14 05:38:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:39,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 05:38:39,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:39,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:38:39,221 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:38:39,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:38:39,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:38:39,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:39,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-14 05:38:39,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:39,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:38:40,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:40,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:38:40,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:38:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:38:40,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:40,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8471 (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_8471) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 05:38:40,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8471 (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_8471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:38:40,143 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-14 05:38:40,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2024-11-14 05:38:40,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8470))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2024-11-14 05:38:40,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8470 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8470))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-14 05:38:40,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8517)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_8470))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-14 05:38:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133933777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:40,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:38:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-14 05:38:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728128744] [2024-11-14 05:38:40,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:40,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:38:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:38:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:38:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=386, Unknown=24, NotChecked=742, Total=1260 [2024-11-14 05:38:40,716 INFO L87 Difference]: Start difference. First operand 5189 states and 7532 transitions. Second operand has 20 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 20 states have internal predecessors, (103), 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-14 05:39:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:00,394 INFO L93 Difference]: Finished difference Result 5190 states and 7535 transitions. [2024-11-14 05:39:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:39:00,394 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 20 states have internal predecessors, (103), 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 126 [2024-11-14 05:39:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:00,400 INFO L225 Difference]: With dead ends: 5190 [2024-11-14 05:39:00,400 INFO L226 Difference]: Without dead ends: 5190 [2024-11-14 05:39:00,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=421, Unknown=24, NotChecked=770, Total=1332 [2024-11-14 05:39:00,401 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 1625 mSDsluCounter, 9608 mSDsCounter, 0 mSdLazyCounter, 8153 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 10964 SdHoareTripleChecker+Invalid, 8187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 8153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:00,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 10964 Invalid, 8187 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 8153 Invalid, 0 Unknown, 0 Unchecked, 19.3s Time] [2024-11-14 05:39:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2024-11-14 05:39:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5188. [2024-11-14 05:39:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 4314 states have (on average 1.7241539174779787) internal successors, (7438), 5143 states have internal predecessors, (7438), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-14 05:39:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7529 transitions. [2024-11-14 05:39:00,453 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7529 transitions. Word has length 126 [2024-11-14 05:39:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:00,453 INFO L471 AbstractCegarLoop]: Abstraction has 5188 states and 7529 transitions. [2024-11-14 05:39:00,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 20 states have internal predecessors, (103), 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-14 05:39:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7529 transitions. [2024-11-14 05:39:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-14 05:39:00,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:00,454 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] [2024-11-14 05:39:00,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Ended with exit code 0 [2024-11-14 05:39:00,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2024-11-14 05:39:00,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2024-11-14 05:39:01,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:39:01,055 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-14 05:39:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1934505396, now seen corresponding path program 1 times [2024-11-14 05:39:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:39:01,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111424090] [2024-11-14 05:39:01,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:01,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:39:01,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:39:01,058 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:39:01,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2024-11-14 05:39:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:02,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-14 05:39:02,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:02,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:39:02,714 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:39:02,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:39:02,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:39:02,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:39:02,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:39:02,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:39:02,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:39:03,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:39:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:39:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:39:03,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:39:03,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:39:03,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:39:04,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:39:04,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:39:04,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:39:04,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:39:04,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:39:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:39:04,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:04,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9004) |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_9003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-14 05:39:04,387 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_9004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:39:04,495 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (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_9002) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9001))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9002) .cse2 v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:39:04,576 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_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9001))) (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_9002) .cse1 v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9002) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-14 05:39:06,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9095))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9001))) (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~mem37#1.base| v_ArrVal_9096) .cse0 v_ArrVal_9002) .cse1 v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9095))) (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~mem37#1.base| v_ArrVal_9096) .cse6 v_ArrVal_9002) (select (select (store .cse7 .cse6 v_ArrVal_9001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9004))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-14 05:39:06,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:39:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111424090] [2024-11-14 05:39:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111424090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136739763] [2024-11-14 05:39:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:39:06,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:39:06,737 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:39:06,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2024-11-14 05:42:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:44,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-14 05:42:44,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:44,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:42:45,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:42:45,042 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:42:45,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:42:45,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:42:45,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:42:45,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:42:45,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:42:46,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:42:46,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:42:46,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:42:46,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:42:46,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:42:46,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:42:47,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:42:47,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:42:47,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:42:47,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:42:47,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:42:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:42:47,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:47,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9582 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-14 05:42:47,372 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_9583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9582 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:42:47,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9580 (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_9581) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9580))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9581) .cse2 v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:42:47,485 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_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9580))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9581) .cse1 v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9581) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2024-11-14 05:42:49,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9675))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9674) .cse1 v_ArrVal_9581) (select (select (store .cse2 .cse1 v_ArrVal_9580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9583))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9675))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9580))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9674) .cse4 v_ArrVal_9581) .cse5 v_ArrVal_9583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 05:42:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2136739763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656365847] [2024-11-14 05:42:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:49,707 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:49,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d2a2ef0-b65c-470d-b29e-4ab1c7e25999/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-11-14 05:42:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:50,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-14 05:42:50,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:50,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:42:51,165 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:42:51,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:42:51,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:42:51,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:42:51,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:42:51,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:42:51,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:42:52,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:42:52,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:42:52,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:42:53,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:42:53,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:42:53,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:42:53,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:42:53,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 05:42:53,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:42:53,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:42:53,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:42:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 05:42:53,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:53,623 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_10162 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10161 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:42:53,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10160))) (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~mem39#1.base| v_ArrVal_10159) .cse0 v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10159) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-14 05:42:53,825 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_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10160))) (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_10159) .cse1 v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10159) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-14 05:42:56,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10254))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10160))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10253) .cse0 v_ArrVal_10159) .cse1 v_ArrVal_10162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10254))) (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~mem37#1.base| v_ArrVal_10253) .cse6 v_ArrVal_10159) (select (select (store .cse7 .cse6 v_ArrVal_10160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10162))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-14 05:42:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656365847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:56,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-14 05:42:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757062437] [2024-11-14 05:42:56,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:42:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:42:56,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:42:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=154, Unknown=21, NotChecked=518, Total=756 [2024-11-14 05:42:56,272 INFO L87 Difference]: Start difference. First operand 5188 states and 7529 transitions. Second operand has 11 states, 9 states have (on average 9.11111111111111) internal successors, (82), 11 states have internal predecessors, (82), 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)