./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh --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 a379a11019678fc2a367efcf212f49fd3083d5f94e928c550866b32de723f686 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:20:18,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:20:18,877 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 18:20:18,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:20:18,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:20:18,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:20:18,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:20:18,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:20:18,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:20:18,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:20:18,911 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:20:18,912 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:20:18,912 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:20:18,913 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:20:18,913 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:20:18,913 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:20:18,914 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:20:18,914 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:20:18,915 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:20:18,916 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:20:18,916 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:20:18,917 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:20:18,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:20:18,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:20:18,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:20:18,919 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:20:18,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:20:18,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:20:18,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:20:18,920 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:20:18,921 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:20:18,921 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:20:18,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:20:18,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:20:18,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:20:18,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:20:18,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:20:18,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:20:18,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:20:18,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:20:18,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:20:18,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:20:18,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:20:18,924 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:20:18,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:20:18,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:20:18,924 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:20:18,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:20:18,925 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh 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 -> a379a11019678fc2a367efcf212f49fd3083d5f94e928c550866b32de723f686 [2023-12-02 18:20:19,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:20:19,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:20:19,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:20:19,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:20:19,143 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:20:19,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i [2023-12-02 18:20:21,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:20:22,120 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:20:22,121 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i [2023-12-02 18:20:22,137 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data/46aa0c3f9/49bc700da7d84af8835563cd5881b400/FLAG8afe85bcb [2023-12-02 18:20:22,149 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data/46aa0c3f9/49bc700da7d84af8835563cd5881b400 [2023-12-02 18:20:22,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:20:22,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:20:22,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:20:22,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:20:22,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:20:22,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:20:22" (1/1) ... [2023-12-02 18:20:22,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a7c603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:22, skipping insertion in model container [2023-12-02 18:20:22,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:20:22" (1/1) ... [2023-12-02 18:20:22,217 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:20:22,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:20:22,632 ERROR L324 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) [2023-12-02 18:20:22,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c7d5132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:22, skipping insertion in model container [2023-12-02 18:20:22,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:20:22,633 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 18:20:22,634 INFO L158 Benchmark]: Toolchain (without parser) took 481.29ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 122.5MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 18:20:22,635 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:20:22,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.15ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 122.5MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 18:20:22,637 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.18ms. Allocated memory is still 100.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.15ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 122.5MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh --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 a379a11019678fc2a367efcf212f49fd3083d5f94e928c550866b32de723f686 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:20:24,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:20:24,444 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 18:20:24,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:20:24,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:20:24,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:20:24,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:20:24,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:20:24,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:20:24,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:20:24,478 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:20:24,479 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:20:24,479 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:20:24,480 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:20:24,480 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:20:24,481 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:20:24,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:20:24,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:20:24,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:20:24,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:20:24,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:20:24,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:20:24,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:20:24,485 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:20:24,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:20:24,486 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:20:24,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:20:24,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:20:24,488 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 18:20:24,488 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 18:20:24,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:20:24,489 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:20:24,489 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:20:24,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:20:24,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 18:20:24,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:20:24,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:20:24,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:20:24,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:20:24,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:20:24,491 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 18:20:24,491 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 18:20:24,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:20:24,492 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:20:24,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:20:24,492 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh 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 -> a379a11019678fc2a367efcf212f49fd3083d5f94e928c550866b32de723f686 [2023-12-02 18:20:24,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:20:24,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:20:24,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:20:24,825 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:20:24,826 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:20:24,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i [2023-12-02 18:20:27,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:20:27,926 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:20:27,927 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i [2023-12-02 18:20:27,945 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data/ec3726227/da30a8f001214c28a0cf12938cbfa257/FLAG0c373dc3d [2023-12-02 18:20:27,960 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/data/ec3726227/da30a8f001214c28a0cf12938cbfa257 [2023-12-02 18:20:27,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:20:27,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:20:27,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:20:27,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:20:27,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:20:27,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:20:27" (1/1) ... [2023-12-02 18:20:27,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aac5418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:27, skipping insertion in model container [2023-12-02 18:20:27,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:20:27" (1/1) ... [2023-12-02 18:20:28,040 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:20:28,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:20:28,576 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 18:20:28,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:20:28,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:20:28,677 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:20:28,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:20:28,785 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:20:28,791 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:20:28,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28 WrapperNode [2023-12-02 18:20:28,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:20:28,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:20:28,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:20:28,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:20:28,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,876 INFO L138 Inliner]: procedures = 180, calls = 287, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1047 [2023-12-02 18:20:28,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:20:28,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:20:28,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:20:28,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:20:28,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:20:28,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:20:28,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:20:28,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:20:28,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (1/1) ... [2023-12-02 18:20:28,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:20:28,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:20:28,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:20:29,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:20:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 18:20:29,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 18:20:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 18:20:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 18:20:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 18:20:29,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 18:20:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 18:20:29,038 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 18:20:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:20:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:20:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 18:20:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:20:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 18:20:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 18:20:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:20:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 18:20:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 18:20:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:20:29,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:20:29,243 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:20:29,245 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:20:29,270 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 18:20:33,486 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:20:33,624 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:20:33,624 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 18:20:33,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:20:33 BoogieIcfgContainer [2023-12-02 18:20:33,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:20:33,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:20:33,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:20:33,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:20:33,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:20:27" (1/3) ... [2023-12-02 18:20:33,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172b5fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:20:33, skipping insertion in model container [2023-12-02 18:20:33,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:20:28" (2/3) ... [2023-12-02 18:20:33,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172b5fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:20:33, skipping insertion in model container [2023-12-02 18:20:33,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:20:33" (3/3) ... [2023-12-02 18:20:33,633 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test3-1.i [2023-12-02 18:20:33,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:20:33,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 533 error locations. [2023-12-02 18:20:33,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:20:33,703 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1d4e4e21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:20:33,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 533 error locations. [2023-12-02 18:20:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 977 states, 433 states have (on average 2.5219399538106235) internal successors, (1092), 970 states have internal predecessors, (1092), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 18:20:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 18:20:33,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:33,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 18:20:33,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:33,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash 54582, now seen corresponding path program 1 times [2023-12-02 18:20:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576985572] [2023-12-02 18:20:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:33,730 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 [2023-12-02 18:20:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:33,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:33,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:33,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:20:33,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:33,941 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 [2023-12-02 18:20:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:33,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:33,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576985572] [2023-12-02 18:20:33,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576985572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:33,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:33,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 18:20:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826108325] [2023-12-02 18:20:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:33,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:20:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:33,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:20:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:33,987 INFO L87 Difference]: Start difference. First operand has 977 states, 433 states have (on average 2.5219399538106235) internal successors, (1092), 970 states have internal predecessors, (1092), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:35,758 INFO L93 Difference]: Finished difference Result 974 states and 1039 transitions. [2023-12-02 18:20:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:20:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 18:20:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:35,780 INFO L225 Difference]: With dead ends: 974 [2023-12-02 18:20:35,780 INFO L226 Difference]: Without dead ends: 973 [2023-12-02 18:20:35,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:35,784 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 901 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:35,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 594 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:20:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2023-12-02 18:20:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 964. [2023-12-02 18:20:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 436 states have (on average 2.3211009174311927) internal successors, (1012), 957 states have internal predecessors, (1012), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1030 transitions. [2023-12-02 18:20:35,878 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1030 transitions. Word has length 2 [2023-12-02 18:20:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:35,878 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1030 transitions. [2023-12-02 18:20:35,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1030 transitions. [2023-12-02 18:20:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 18:20:35,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:35,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 18:20:35,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:20:36,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:36,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:36,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 54583, now seen corresponding path program 1 times [2023-12-02 18:20:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:36,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320713194] [2023-12-02 18:20:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:36,083 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 [2023-12-02 18:20:36,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:36,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:36,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:36,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:20:36,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:36,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:20:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:36,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:36,208 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320713194] [2023-12-02 18:20:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320713194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:36,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:36,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 18:20:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896854125] [2023-12-02 18:20:36,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:36,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:20:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:20:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:36,211 INFO L87 Difference]: Start difference. First operand 964 states and 1030 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:39,090 INFO L93 Difference]: Finished difference Result 1339 states and 1446 transitions. [2023-12-02 18:20:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:20:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 18:20:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:39,098 INFO L225 Difference]: With dead ends: 1339 [2023-12-02 18:20:39,099 INFO L226 Difference]: Without dead ends: 1339 [2023-12-02 18:20:39,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:39,100 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 405 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:39,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1260 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 18:20:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2023-12-02 18:20:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1133. [2023-12-02 18:20:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 606 states have (on average 2.298679867986799) internal successors, (1393), 1126 states have internal predecessors, (1393), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1411 transitions. [2023-12-02 18:20:39,137 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1411 transitions. Word has length 2 [2023-12-02 18:20:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:39,137 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1411 transitions. [2023-12-02 18:20:39,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1411 transitions. [2023-12-02 18:20:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 18:20:39,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:39,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 18:20:39,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 18:20:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:39,340 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:39,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1132069568, now seen corresponding path program 1 times [2023-12-02 18:20:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483731067] [2023-12-02 18:20:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:39,342 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 [2023-12-02 18:20:39,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:39,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:39,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:39,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:20:39,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:39,486 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 [2023-12-02 18:20:39,493 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 [2023-12-02 18:20:39,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:20:39,556 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 [2023-12-02 18:20:39,576 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:20:39,577 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 [2023-12-02 18:20:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:39,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:39,598 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483731067] [2023-12-02 18:20:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483731067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:39,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:39,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:20:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073880022] [2023-12-02 18:20:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:39,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:20:39,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:39,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:20:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:39,600 INFO L87 Difference]: Start difference. First operand 1133 states and 1411 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:42,159 INFO L93 Difference]: Finished difference Result 1136 states and 1416 transitions. [2023-12-02 18:20:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:20:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 18:20:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:42,165 INFO L225 Difference]: With dead ends: 1136 [2023-12-02 18:20:42,165 INFO L226 Difference]: Without dead ends: 1136 [2023-12-02 18:20:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:42,166 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 986 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:42,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 316 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 18:20:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-02 18:20:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 953. [2023-12-02 18:20:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 436 states have (on average 2.293577981651376) internal successors, (1000), 946 states have internal predecessors, (1000), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1018 transitions. [2023-12-02 18:20:42,187 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1018 transitions. Word has length 6 [2023-12-02 18:20:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:42,188 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1018 transitions. [2023-12-02 18:20:42,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1018 transitions. [2023-12-02 18:20:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 18:20:42,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:42,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:20:42,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:42,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:42,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:42,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -734418257, now seen corresponding path program 1 times [2023-12-02 18:20:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756386378] [2023-12-02 18:20:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:42,393 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 [2023-12-02 18:20:42,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:42,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:42,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:42,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:20:42,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:42,529 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 [2023-12-02 18:20:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:42,542 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:42,542 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756386378] [2023-12-02 18:20:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756386378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:42,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:20:42,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539125944] [2023-12-02 18:20:42,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:42,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:20:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:42,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:20:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:42,544 INFO L87 Difference]: Start difference. First operand 953 states and 1018 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 18:20:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:44,614 INFO L93 Difference]: Finished difference Result 1247 states and 1342 transitions. [2023-12-02 18:20:44,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:20:44,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2023-12-02 18:20:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:44,620 INFO L225 Difference]: With dead ends: 1247 [2023-12-02 18:20:44,620 INFO L226 Difference]: Without dead ends: 1247 [2023-12-02 18:20:44,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:44,621 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 895 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:44,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1003 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 18:20:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-12-02 18:20:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 904. [2023-12-02 18:20:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 436 states have (on average 2.1811926605504586) internal successors, (951), 897 states have internal predecessors, (951), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 969 transitions. [2023-12-02 18:20:44,638 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 969 transitions. Word has length 7 [2023-12-02 18:20:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:44,638 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 969 transitions. [2023-12-02 18:20:44,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 18:20:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 969 transitions. [2023-12-02 18:20:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 18:20:44,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:44,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:20:44,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:44,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:44,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:44,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -734418256, now seen corresponding path program 1 times [2023-12-02 18:20:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:44,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851974257] [2023-12-02 18:20:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:44,841 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 [2023-12-02 18:20:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:44,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:44,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:44,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:20:44,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:44,952 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 [2023-12-02 18:20:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:44,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:44,973 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851974257] [2023-12-02 18:20:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851974257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:20:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806832766] [2023-12-02 18:20:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:44,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:20:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:20:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:44,975 INFO L87 Difference]: Start difference. First operand 904 states and 969 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 18:20:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:47,914 INFO L93 Difference]: Finished difference Result 1317 states and 1415 transitions. [2023-12-02 18:20:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:20:47,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2023-12-02 18:20:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:47,920 INFO L225 Difference]: With dead ends: 1317 [2023-12-02 18:20:47,920 INFO L226 Difference]: Without dead ends: 1317 [2023-12-02 18:20:47,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:47,921 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 613 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:47,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1326 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 18:20:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-12-02 18:20:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 917. [2023-12-02 18:20:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 459 states have (on average 2.1742919389978215) internal successors, (998), 910 states have internal predecessors, (998), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1016 transitions. [2023-12-02 18:20:47,939 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1016 transitions. Word has length 7 [2023-12-02 18:20:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:47,939 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1016 transitions. [2023-12-02 18:20:47,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 18:20:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1016 transitions. [2023-12-02 18:20:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:20:47,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:47,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:20:47,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:48,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:48,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:48,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1228521271, now seen corresponding path program 1 times [2023-12-02 18:20:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728650473] [2023-12-02 18:20:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:48,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:48,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:48,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:48,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:20:48,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:48,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:48,298 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728650473] [2023-12-02 18:20:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728650473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:20:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759877602] [2023-12-02 18:20:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:48,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:20:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:20:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:48,299 INFO L87 Difference]: Start difference. First operand 917 states and 1016 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:49,958 INFO L93 Difference]: Finished difference Result 1325 states and 1458 transitions. [2023-12-02 18:20:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:20:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-02 18:20:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:49,965 INFO L225 Difference]: With dead ends: 1325 [2023-12-02 18:20:49,965 INFO L226 Difference]: Without dead ends: 1325 [2023-12-02 18:20:49,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:20:49,966 INFO L413 NwaCegarLoop]: 894 mSDtfsCounter, 497 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:49,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2412 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 18:20:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2023-12-02 18:20:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1117. [2023-12-02 18:20:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 659 states have (on average 2.1441578148710168) internal successors, (1413), 1110 states have internal predecessors, (1413), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1431 transitions. [2023-12-02 18:20:49,989 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1431 transitions. Word has length 10 [2023-12-02 18:20:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:49,989 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1431 transitions. [2023-12-02 18:20:49,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1431 transitions. [2023-12-02 18:20:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 18:20:49,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:49,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:20:49,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 18:20:50,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:50,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr531ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:50,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 570547524, now seen corresponding path program 1 times [2023-12-02 18:20:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:50,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689378410] [2023-12-02 18:20:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:50,192 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 [2023-12-02 18:20:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:50,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:50,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:50,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:20:50,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:50,369 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:20:50,369 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:20:50,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:20:50,374 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 [2023-12-02 18:20:50,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:20:50,432 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 [2023-12-02 18:20:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:50,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:50,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689378410] [2023-12-02 18:20:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689378410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:20:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742172683] [2023-12-02 18:20:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:50,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:20:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:50,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:20:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:50,448 INFO L87 Difference]: Start difference. First operand 1117 states and 1431 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-12-02 18:20:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:52,310 INFO L93 Difference]: Finished difference Result 1464 states and 1849 transitions. [2023-12-02 18:20:52,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:20:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2023-12-02 18:20:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:52,316 INFO L225 Difference]: With dead ends: 1464 [2023-12-02 18:20:52,316 INFO L226 Difference]: Without dead ends: 1464 [2023-12-02 18:20:52,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:20:52,317 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 348 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2426 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:52,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2426 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 18:20:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2023-12-02 18:20:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1116. [2023-12-02 18:20:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 658 states have (on average 2.1443768996960486) internal successors, (1411), 1109 states have internal predecessors, (1411), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1429 transitions. [2023-12-02 18:20:52,342 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1429 transitions. Word has length 11 [2023-12-02 18:20:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:52,342 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1429 transitions. [2023-12-02 18:20:52,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-12-02 18:20:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1429 transitions. [2023-12-02 18:20:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 18:20:52,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:52,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:20:52,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 18:20:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:52,553 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:52,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash 661679463, now seen corresponding path program 1 times [2023-12-02 18:20:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:52,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119012592] [2023-12-02 18:20:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:52,554 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 [2023-12-02 18:20:52,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:52,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:52,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:52,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:20:52,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:52,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:52,728 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119012592] [2023-12-02 18:20:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119012592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:52,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:20:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15355194] [2023-12-02 18:20:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:52,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:20:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:20:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:52,729 INFO L87 Difference]: Start difference. First operand 1116 states and 1429 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:53,428 INFO L93 Difference]: Finished difference Result 1062 states and 1349 transitions. [2023-12-02 18:20:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:20:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 18:20:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:53,434 INFO L225 Difference]: With dead ends: 1062 [2023-12-02 18:20:53,434 INFO L226 Difference]: Without dead ends: 1062 [2023-12-02 18:20:53,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:20:53,435 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 70 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:53,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1545 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 18:20:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2023-12-02 18:20:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2023-12-02 18:20:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 628 states have (on average 2.1194267515923566) internal successors, (1331), 1055 states have internal predecessors, (1331), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1349 transitions. [2023-12-02 18:20:53,451 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1349 transitions. Word has length 15 [2023-12-02 18:20:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:53,451 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1349 transitions. [2023-12-02 18:20:53,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1349 transitions. [2023-12-02 18:20:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 18:20:53,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:53,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:20:53,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:53,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:53,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:53,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash 218799840, now seen corresponding path program 1 times [2023-12-02 18:20:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428463330] [2023-12-02 18:20:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:53,654 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 [2023-12-02 18:20:53,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:53,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:53,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:53,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:20:53,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:53,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:53,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428463330] [2023-12-02 18:20:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428463330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:20:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108180310] [2023-12-02 18:20:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:53,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:20:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:20:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:53,841 INFO L87 Difference]: Start difference. First operand 1062 states and 1349 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:54,794 INFO L93 Difference]: Finished difference Result 1048 states and 1307 transitions. [2023-12-02 18:20:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:20:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 18:20:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:54,800 INFO L225 Difference]: With dead ends: 1048 [2023-12-02 18:20:54,800 INFO L226 Difference]: Without dead ends: 1048 [2023-12-02 18:20:54,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:20:54,801 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 58 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:54,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2274 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 18:20:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-12-02 18:20:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2023-12-02 18:20:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 626 states have (on average 2.0559105431309903) internal successors, (1287), 1039 states have internal predecessors, (1287), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1305 transitions. [2023-12-02 18:20:54,817 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1305 transitions. Word has length 17 [2023-12-02 18:20:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:54,817 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1305 transitions. [2023-12-02 18:20:54,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1305 transitions. [2023-12-02 18:20:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:20:54,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:54,819 INFO L195 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] [2023-12-02 18:20:54,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-02 18:20:55,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:55,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:55,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash -195365074, now seen corresponding path program 1 times [2023-12-02 18:20:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:55,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8854164] [2023-12-02 18:20:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:55,021 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 [2023-12-02 18:20:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:55,022 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:55,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:55,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:20:55,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:55,176 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 [2023-12-02 18:20:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:55,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:55,239 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:55,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8854164] [2023-12-02 18:20:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8854164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:55,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:55,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:20:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289940073] [2023-12-02 18:20:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:55,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:20:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:20:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:55,241 INFO L87 Difference]: Start difference. First operand 1046 states and 1305 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:20:57,605 INFO L93 Difference]: Finished difference Result 1448 states and 1829 transitions. [2023-12-02 18:20:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:20:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 18:20:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:20:57,612 INFO L225 Difference]: With dead ends: 1448 [2023-12-02 18:20:57,612 INFO L226 Difference]: Without dead ends: 1448 [2023-12-02 18:20:57,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:20:57,612 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 828 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:20:57,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1003 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 18:20:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2023-12-02 18:20:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1042. [2023-12-02 18:20:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 626 states have (on average 2.0431309904153356) internal successors, (1279), 1035 states have internal predecessors, (1279), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:20:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1297 transitions. [2023-12-02 18:20:57,640 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1297 transitions. Word has length 31 [2023-12-02 18:20:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:20:57,640 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1297 transitions. [2023-12-02 18:20:57,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:20:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1297 transitions. [2023-12-02 18:20:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:20:57,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:20:57,642 INFO L195 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] [2023-12-02 18:20:57,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:57,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:20:57,842 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:20:57,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:20:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -195365073, now seen corresponding path program 1 times [2023-12-02 18:20:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:20:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731683720] [2023-12-02 18:20:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:20:57,843 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 [2023-12-02 18:20:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:20:57,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:20:57,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:20:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:20:58,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:20:58,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:20:58,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:20:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:20:58,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:20:58,186 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:20:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731683720] [2023-12-02 18:20:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731683720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:20:58,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:20:58,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:20:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135913414] [2023-12-02 18:20:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:20:58,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:20:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:20:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:20:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:20:58,188 INFO L87 Difference]: Start difference. First operand 1042 states and 1297 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:01,841 INFO L93 Difference]: Finished difference Result 1566 states and 1972 transitions. [2023-12-02 18:21:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:21:01,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 18:21:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:01,848 INFO L225 Difference]: With dead ends: 1566 [2023-12-02 18:21:01,848 INFO L226 Difference]: Without dead ends: 1566 [2023-12-02 18:21:01,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:21:01,849 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 548 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:01,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1976 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 18:21:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2023-12-02 18:21:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1038. [2023-12-02 18:21:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 626 states have (on average 2.0303514376996805) internal successors, (1271), 1031 states have internal predecessors, (1271), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:21:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1289 transitions. [2023-12-02 18:21:01,872 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1289 transitions. Word has length 31 [2023-12-02 18:21:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:01,872 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1289 transitions. [2023-12-02 18:21:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1289 transitions. [2023-12-02 18:21:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 18:21:01,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:01,874 INFO L195 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] [2023-12-02 18:21:01,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:02,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:02,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:02,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1055920008, now seen corresponding path program 1 times [2023-12-02 18:21:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:02,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689446703] [2023-12-02 18:21:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:02,076 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 [2023-12-02 18:21:02,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:02,077 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:02,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:02,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:21:02,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:02,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:21:02,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689446703] [2023-12-02 18:21:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689446703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:21:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:21:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:21:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938078252] [2023-12-02 18:21:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:21:02,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:21:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:21:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:21:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:21:02,312 INFO L87 Difference]: Start difference. First operand 1038 states and 1289 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:03,296 INFO L93 Difference]: Finished difference Result 1026 states and 1269 transitions. [2023-12-02 18:21:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:21:03,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-02 18:21:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:03,302 INFO L225 Difference]: With dead ends: 1026 [2023-12-02 18:21:03,302 INFO L226 Difference]: Without dead ends: 1026 [2023-12-02 18:21:03,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:21:03,302 INFO L413 NwaCegarLoop]: 760 mSDtfsCounter, 23 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:03,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2260 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:21:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-12-02 18:21:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2023-12-02 18:21:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 614 states have (on average 2.037459283387622) internal successors, (1251), 1019 states have internal predecessors, (1251), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:21:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1269 transitions. [2023-12-02 18:21:03,316 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1269 transitions. Word has length 50 [2023-12-02 18:21:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:03,317 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1269 transitions. [2023-12-02 18:21:03,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1269 transitions. [2023-12-02 18:21:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 18:21:03,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:03,319 INFO L195 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] [2023-12-02 18:21:03,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:03,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:03,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:03,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash 566526599, now seen corresponding path program 1 times [2023-12-02 18:21:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341955117] [2023-12-02 18:21:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:03,520 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 [2023-12-02 18:21:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:03,521 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:03,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:03,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:21:03,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:03,811 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 [2023-12-02 18:21:03,816 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 [2023-12-02 18:21:04,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:21:04,259 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 [2023-12-02 18:21:04,273 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:21:04,273 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 [2023-12-02 18:21:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:04,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:21:04,284 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341955117] [2023-12-02 18:21:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341955117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:21:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:21:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:21:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540806612] [2023-12-02 18:21:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:21:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:21:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:21:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:21:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:21:04,286 INFO L87 Difference]: Start difference. First operand 1026 states and 1269 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:07,008 INFO L93 Difference]: Finished difference Result 1394 states and 1763 transitions. [2023-12-02 18:21:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:21:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-12-02 18:21:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:07,014 INFO L225 Difference]: With dead ends: 1394 [2023-12-02 18:21:07,014 INFO L226 Difference]: Without dead ends: 1394 [2023-12-02 18:21:07,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:21:07,019 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1806 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:07,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 398 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 18:21:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2023-12-02 18:21:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 965. [2023-12-02 18:21:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 591 states have (on average 1.9560067681895092) internal successors, (1156), 958 states have internal predecessors, (1156), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:21:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1174 transitions. [2023-12-02 18:21:07,034 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1174 transitions. Word has length 54 [2023-12-02 18:21:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:07,034 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1174 transitions. [2023-12-02 18:21:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1174 transitions. [2023-12-02 18:21:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 18:21:07,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:07,036 INFO L195 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] [2023-12-02 18:21:07,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:07,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:07,236 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:07,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 521436340, now seen corresponding path program 1 times [2023-12-02 18:21:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106449161] [2023-12-02 18:21:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:07,238 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 [2023-12-02 18:21:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:07,238 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:07,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:07,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:21:07,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:07,481 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 [2023-12-02 18:21:07,494 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 [2023-12-02 18:21:07,516 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 [2023-12-02 18:21:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:07,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:21:07,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106449161] [2023-12-02 18:21:07,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106449161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:21:07,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:21:07,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:21:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531356763] [2023-12-02 18:21:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:21:07,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:21:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:21:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:21:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:21:07,528 INFO L87 Difference]: Start difference. First operand 965 states and 1174 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:10,367 INFO L93 Difference]: Finished difference Result 964 states and 1173 transitions. [2023-12-02 18:21:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:21:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-02 18:21:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:10,371 INFO L225 Difference]: With dead ends: 964 [2023-12-02 18:21:10,371 INFO L226 Difference]: Without dead ends: 964 [2023-12-02 18:21:10,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:21:10,372 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 3 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:10,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1925 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 18:21:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-02 18:21:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2023-12-02 18:21:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 591 states have (on average 1.9543147208121827) internal successors, (1155), 957 states have internal predecessors, (1155), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:21:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1173 transitions. [2023-12-02 18:21:10,382 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1173 transitions. Word has length 58 [2023-12-02 18:21:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:10,383 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1173 transitions. [2023-12-02 18:21:10,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1173 transitions. [2023-12-02 18:21:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 18:21:10,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:10,384 INFO L195 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] [2023-12-02 18:21:10,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 18:21:10,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:10,584 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:10,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash 521436341, now seen corresponding path program 1 times [2023-12-02 18:21:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490942935] [2023-12-02 18:21:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:10,585 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 [2023-12-02 18:21:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:10,586 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:10,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:10,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:21:10,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:10,843 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 [2023-12-02 18:21:10,861 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 [2023-12-02 18:21:10,869 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 [2023-12-02 18:21:10,906 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 [2023-12-02 18:21:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:10,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:21:10,923 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490942935] [2023-12-02 18:21:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490942935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:21:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:21:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:21:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624736332] [2023-12-02 18:21:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:21:10,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:21:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:21:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:21:10,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:21:10,924 INFO L87 Difference]: Start difference. First operand 964 states and 1173 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:13,990 INFO L93 Difference]: Finished difference Result 963 states and 1172 transitions. [2023-12-02 18:21:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:21:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-02 18:21:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:13,995 INFO L225 Difference]: With dead ends: 963 [2023-12-02 18:21:13,995 INFO L226 Difference]: Without dead ends: 963 [2023-12-02 18:21:13,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:21:13,996 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 1 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:13,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1962 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 18:21:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-12-02 18:21:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2023-12-02 18:21:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 590 states have (on average 1.9559322033898305) internal successors, (1154), 956 states have internal predecessors, (1154), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 18:21:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1172 transitions. [2023-12-02 18:21:14,007 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1172 transitions. Word has length 58 [2023-12-02 18:21:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:14,007 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1172 transitions. [2023-12-02 18:21:14,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:21:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1172 transitions. [2023-12-02 18:21:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 18:21:14,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:14,008 INFO L195 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] [2023-12-02 18:21:14,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:14,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:14,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:14,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 411489050, now seen corresponding path program 1 times [2023-12-02 18:21:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791224815] [2023-12-02 18:21:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:14,210 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 [2023-12-02 18:21:14,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:14,211 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:14,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:14,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:21:14,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:14,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:21:14,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:14,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791224815] [2023-12-02 18:21:14,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791224815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:21:14,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:21:14,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:21:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767689760] [2023-12-02 18:21:14,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:21:14,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:21:14,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:21:14,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:21:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:21:14,482 INFO L87 Difference]: Start difference. First operand 963 states and 1172 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2023-12-02 18:21:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:15,359 INFO L93 Difference]: Finished difference Result 965 states and 1175 transitions. [2023-12-02 18:21:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:21:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-12-02 18:21:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:15,365 INFO L225 Difference]: With dead ends: 965 [2023-12-02 18:21:15,365 INFO L226 Difference]: Without dead ends: 965 [2023-12-02 18:21:15,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:21:15,366 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 1 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:15,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2199 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 18:21:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-12-02 18:21:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2023-12-02 18:21:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 591 states have (on average 1.9560067681895092) internal successors, (1156), 958 states have internal predecessors, (1156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:21:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1175 transitions. [2023-12-02 18:21:15,380 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1175 transitions. Word has length 64 [2023-12-02 18:21:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:15,380 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1175 transitions. [2023-12-02 18:21:15,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2023-12-02 18:21:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1175 transitions. [2023-12-02 18:21:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 18:21:15,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:15,381 INFO L195 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] [2023-12-02 18:21:15,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 18:21:15,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:15,581 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:15,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1894795278, now seen corresponding path program 1 times [2023-12-02 18:21:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682724576] [2023-12-02 18:21:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:15,582 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 [2023-12-02 18:21:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:15,583 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:15,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:15,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:21:15,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:15,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:21:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:15,918 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:15,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682724576] [2023-12-02 18:21:15,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682724576] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:21:15,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097884696] [2023-12-02 18:21:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:21:15,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:21:15,920 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:21:15,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-02 18:21:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:16,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:21:16,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:16,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:21:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1097884696] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:21:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914262728] [2023-12-02 18:21:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:21:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:21:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:21:16,430 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:21:16,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 18:21:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:21:16,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:21:16,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:16,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:21:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:16,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914262728] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:21:16,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:21:16,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 18:21:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368190353] [2023-12-02 18:21:16,715 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:21:16,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 18:21:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:21:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 18:21:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:21:16,716 INFO L87 Difference]: Start difference. First operand 965 states and 1175 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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) [2023-12-02 18:21:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:21:18,478 INFO L93 Difference]: Finished difference Result 974 states and 1189 transitions. [2023-12-02 18:21:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:21:18,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2023-12-02 18:21:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:21:18,483 INFO L225 Difference]: With dead ends: 974 [2023-12-02 18:21:18,483 INFO L226 Difference]: Without dead ends: 974 [2023-12-02 18:21:18,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:21:18,484 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 6 mSDsluCounter, 4386 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5119 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:21:18,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5119 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:21:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-02 18:21:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 973. [2023-12-02 18:21:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 598 states have (on average 1.9548494983277591) internal successors, (1169), 965 states have internal predecessors, (1169), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:21:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1188 transitions. [2023-12-02 18:21:18,497 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1188 transitions. Word has length 65 [2023-12-02 18:21:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:21:18,497 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1188 transitions. [2023-12-02 18:21:18,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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) [2023-12-02 18:21:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1188 transitions. [2023-12-02 18:21:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-02 18:21:18,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:21:18,498 INFO L195 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] [2023-12-02 18:21:18,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 18:21:18,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-12-02 18:21:18,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-02 18:21:19,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:21:19,099 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:21:19,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:21:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -435861222, now seen corresponding path program 2 times [2023-12-02 18:21:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:21:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139481202] [2023-12-02 18:21:19,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:21:19,100 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 [2023-12-02 18:21:19,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:21:19,101 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:21:19,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:21:19,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:21:19,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:21:19,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:21:19,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:19,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:21:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:19,709 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:21:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139481202] [2023-12-02 18:21:19,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139481202] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:21:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [516330052] [2023-12-02 18:21:19,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:21:19,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:21:19,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:21:19,710 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:21:19,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-02 18:21:21,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:21:21,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:21:21,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:21:21,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:21:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:21,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:21:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:21:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [516330052] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:21:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694002521] [2023-12-02 18:21:21,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:21:21,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:21:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:21:21,158 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:21:21,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 18:22:05,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:22:05,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:22:05,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 18:22:05,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:05,527 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:22:05,527 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 [2023-12-02 18:22:05,558 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 [2023-12-02 18:22:05,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:22:05,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:22:05,880 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 [2023-12-02 18:22:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:22:05,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:06,016 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:22:06,016 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 [2023-12-02 18:22:06,026 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem38#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1587) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 18:22:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694002521] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:22:06,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 18:22:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2023-12-02 18:22:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332157959] [2023-12-02 18:22:06,029 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 18:22:06,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 18:22:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:22:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 18:22:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2023-12-02 18:22:06,031 INFO L87 Difference]: Start difference. First operand 973 states and 1188 transitions. Second operand has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 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) [2023-12-02 18:22:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:22:16,912 INFO L93 Difference]: Finished difference Result 1393 states and 1741 transitions. [2023-12-02 18:22:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 18:22:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 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 68 [2023-12-02 18:22:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:22:16,919 INFO L225 Difference]: With dead ends: 1393 [2023-12-02 18:22:16,919 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 18:22:16,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2206, Unknown=1, NotChecked=100, Total=2756 [2023-12-02 18:22:16,920 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 746 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 7118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 6159 SdHoareTripleChecker+Invalid, 7146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:22:16,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 6159 Invalid, 7146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 7118 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-12-02 18:22:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 18:22:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 981. [2023-12-02 18:22:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 607 states have (on average 1.9439868204283361) internal successors, (1180), 973 states have internal predecessors, (1180), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:22:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1199 transitions. [2023-12-02 18:22:16,935 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1199 transitions. Word has length 68 [2023-12-02 18:22:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:22:16,935 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1199 transitions. [2023-12-02 18:22:16,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 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) [2023-12-02 18:22:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1199 transitions. [2023-12-02 18:22:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-02 18:22:16,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:22:16,936 INFO L195 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] [2023-12-02 18:22:16,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-12-02 18:22:17,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-02 18:22:17,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 18:22:17,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:22:17,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:22:17,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:22:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1482008037, now seen corresponding path program 1 times [2023-12-02 18:22:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:22:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625974150] [2023-12-02 18:22:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:22:17,538 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 [2023-12-02 18:22:17,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:22:17,539 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:22:17,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:22:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:22:17,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 18:22:17,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:17,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:18,374 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:22:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625974150] [2023-12-02 18:22:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625974150] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:22:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [890757885] [2023-12-02 18:22:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:22:18,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:22:18,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:22:18,376 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:22:18,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 18:22:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:22:18,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 18:22:18,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:18,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [890757885] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:22:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563963496] [2023-12-02 18:22:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:22:19,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:22:19,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:22:19,030 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:22:19,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 18:22:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:22:19,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 18:22:19,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:19,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563963496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:22:20,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:22:20,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 18:22:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027905064] [2023-12-02 18:22:20,115 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:22:20,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 18:22:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:22:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 18:22:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 18:22:20,117 INFO L87 Difference]: Start difference. First operand 981 states and 1199 transitions. Second operand has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 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) [2023-12-02 18:22:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:22:26,463 INFO L93 Difference]: Finished difference Result 1011 states and 1244 transitions. [2023-12-02 18:22:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 18:22:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 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 74 [2023-12-02 18:22:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:22:26,468 INFO L225 Difference]: With dead ends: 1011 [2023-12-02 18:22:26,468 INFO L226 Difference]: Without dead ends: 1008 [2023-12-02 18:22:26,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 18:22:26,469 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 26 mSDsluCounter, 10942 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11673 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:22:26,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 11673 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-02 18:22:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-12-02 18:22:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 999. [2023-12-02 18:22:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 625 states have (on average 1.9248) internal successors, (1203), 991 states have internal predecessors, (1203), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:22:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1222 transitions. [2023-12-02 18:22:26,484 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1222 transitions. Word has length 74 [2023-12-02 18:22:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:22:26,484 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1222 transitions. [2023-12-02 18:22:26,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 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) [2023-12-02 18:22:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1222 transitions. [2023-12-02 18:22:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 18:22:26,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:22:26,485 INFO L195 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] [2023-12-02 18:22:26,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-02 18:22:26,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-02 18:22:26,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 18:22:27,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:22:27,086 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:22:27,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:22:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1225931803, now seen corresponding path program 2 times [2023-12-02 18:22:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:22:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946353499] [2023-12-02 18:22:27,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:22:27,088 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 [2023-12-02 18:22:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:22:27,088 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:22:27,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:22:27,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:22:27,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:22:27,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 18:22:27,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:28,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:30,337 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:22:30,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946353499] [2023-12-02 18:22:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946353499] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:22:30,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1974754846] [2023-12-02 18:22:30,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:22:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:22:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:22:30,338 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:22:30,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 18:22:31,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:22:31,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:22:31,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 18:22:31,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:32,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:22:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1974754846] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:22:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248224764] [2023-12-02 18:22:32,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:22:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:22:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:22:32,631 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:22:32,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 18:22:46,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:22:46,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:22:46,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 18:22:46,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:22:46,550 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 [2023-12-02 18:22:46,685 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:22:46,686 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 [2023-12-02 18:22:46,692 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 [2023-12-02 18:22:46,809 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 [2023-12-02 18:22:46,814 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 [2023-12-02 18:22:47,126 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 [2023-12-02 18:22:47,130 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 [2023-12-02 18:22:47,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:22:47,655 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 [2023-12-02 18:22:47,665 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 [2023-12-02 18:22:47,823 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 [2023-12-02 18:22:47,829 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 [2023-12-02 18:22:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 18:22:47,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:22:48,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 18:22:48,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248224764] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:22:48,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 18:22:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2023-12-02 18:22:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728994482] [2023-12-02 18:22:48,757 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 18:22:48,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-02 18:22:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:22:48,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-02 18:22:48,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2023-12-02 18:22:48,759 INFO L87 Difference]: Start difference. First operand 999 states and 1222 transitions. Second operand has 57 states, 54 states have (on average 3.1296296296296298) internal successors, (169), 57 states have internal predecessors, (169), 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) [2023-12-02 18:23:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:23:29,192 INFO L93 Difference]: Finished difference Result 1467 states and 1856 transitions. [2023-12-02 18:23:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-02 18:23:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 3.1296296296296298) internal successors, (169), 57 states have internal predecessors, (169), 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 86 [2023-12-02 18:23:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:23:29,201 INFO L225 Difference]: With dead ends: 1467 [2023-12-02 18:23:29,201 INFO L226 Difference]: Without dead ends: 1460 [2023-12-02 18:23:29,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3720 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3451, Invalid=16012, Unknown=1, NotChecked=276, Total=19740 [2023-12-02 18:23:29,209 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 774 mSDsluCounter, 10885 mSDsCounter, 0 mSdLazyCounter, 16441 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 11302 SdHoareTripleChecker+Invalid, 16509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 16441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:23:29,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 11302 Invalid, 16509 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 16441 Invalid, 0 Unknown, 0 Unchecked, 29.5s Time] [2023-12-02 18:23:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2023-12-02 18:23:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1034. [2023-12-02 18:23:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 661 states have (on average 1.8850226928895613) internal successors, (1246), 1026 states have internal predecessors, (1246), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:23:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1265 transitions. [2023-12-02 18:23:29,232 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1265 transitions. Word has length 86 [2023-12-02 18:23:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:23:29,232 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1265 transitions. [2023-12-02 18:23:29,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 3.1296296296296298) internal successors, (169), 57 states have internal predecessors, (169), 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) [2023-12-02 18:23:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1265 transitions. [2023-12-02 18:23:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 18:23:29,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:23:29,233 INFO L195 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] [2023-12-02 18:23:29,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:23:29,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 18:23:29,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 18:23:29,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 18:23:29,834 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:23:29,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:23:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 480841229, now seen corresponding path program 1 times [2023-12-02 18:23:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:23:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793891461] [2023-12-02 18:23:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:23:29,835 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 [2023-12-02 18:23:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:23:29,836 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:23:29,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:23:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:23:30,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 18:23:30,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:23:30,610 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 [2023-12-02 18:23:30,707 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:23:30,707 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 [2023-12-02 18:23:30,737 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 [2023-12-02 18:23:30,832 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 [2023-12-02 18:23:31,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:23:31,748 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 [2023-12-02 18:23:31,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:23:31,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:23:31,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 33 treesize of output 15 [2023-12-02 18:23:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:23:31,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:23:33,992 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:23:34,373 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3360))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3314)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:23:34,376 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:23:34,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793891461] [2023-12-02 18:23:34,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793891461] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:23:34,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1965318381] [2023-12-02 18:23:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:23:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:23:34,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:23:34,377 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:23:34,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 18:23:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:23:36,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 18:23:36,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:23:36,604 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 [2023-12-02 18:23:36,857 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:23:36,858 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 [2023-12-02 18:23:36,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:23:37,061 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 20 treesize of output 12 [2023-12-02 18:23:37,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:23:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 18:23:38,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:23:38,155 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 36 treesize of output 35 [2023-12-02 18:23:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 18:23:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:23:38,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:23:38,200 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_3784) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 18:23:38,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 18:23:38,601 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3830))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3784)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:23:38,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1965318381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:23:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227688598] [2023-12-02 18:23:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:23:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:23:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:23:38,605 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:23:38,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 18:23:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:23:39,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 18:23:39,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:23:39,238 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:23:39,239 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 [2023-12-02 18:23:39,278 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 [2023-12-02 18:23:39,649 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:23:39,649 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 [2023-12-02 18:23:39,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:23:39,740 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 [2023-12-02 18:23:39,798 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 [2023-12-02 18:23:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:23:39,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:23:39,823 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:23:39,823 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 [2023-12-02 18:23:39,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2023-12-02 18:23:40,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4298)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 18:23:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227688598] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:23:40,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:23:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-12-02 18:23:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391192653] [2023-12-02 18:23:40,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:23:40,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 18:23:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:23:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 18:23:40,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=528, Unknown=25, NotChecked=378, Total=1056 [2023-12-02 18:23:40,321 INFO L87 Difference]: Start difference. First operand 1034 states and 1265 transitions. Second operand has 23 states, 19 states have (on average 7.473684210526316) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:23:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:23:48,937 INFO L93 Difference]: Finished difference Result 1440 states and 1797 transitions. [2023-12-02 18:23:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 18:23:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.473684210526316) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 110 [2023-12-02 18:23:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:23:48,944 INFO L225 Difference]: With dead ends: 1440 [2023-12-02 18:23:48,944 INFO L226 Difference]: Without dead ends: 1440 [2023-12-02 18:23:48,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=136, Invalid=569, Unknown=25, NotChecked=392, Total=1122 [2023-12-02 18:23:48,945 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 730 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 4524 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 4551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:23:48,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 3920 Invalid, 4551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4524 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-12-02 18:23:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2023-12-02 18:23:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1033. [2023-12-02 18:23:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 661 states have (on average 1.8835098335854765) internal successors, (1245), 1025 states have internal predecessors, (1245), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:23:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1264 transitions. [2023-12-02 18:23:48,959 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1264 transitions. Word has length 110 [2023-12-02 18:23:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:23:48,959 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1264 transitions. [2023-12-02 18:23:48,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.473684210526316) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:23:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1264 transitions. [2023-12-02 18:23:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 18:23:48,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:23:48,960 INFO L195 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] [2023-12-02 18:23:48,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 18:23:49,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-02 18:23:49,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 18:23:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:23:49,561 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:23:49,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:23:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash 480841230, now seen corresponding path program 1 times [2023-12-02 18:23:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:23:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379320446] [2023-12-02 18:23:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:23:49,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:23:49,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:23:49,563 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:23:49,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-02 18:23:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:23:50,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 18:23:50,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:23:50,389 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 [2023-12-02 18:23:50,647 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 [2023-12-02 18:23:50,663 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:23:50,664 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 [2023-12-02 18:23:50,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:23:50,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:23:50,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 18:23:50,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:23:51,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:23:51,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:23:51,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:23:51,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:23:51,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:23:51,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:23:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 18:23:51,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:23:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:23:51,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:23:51,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4767) |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_4768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 18:23:51,852 WARN L854 $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_4768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 18:23:53,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4859))) (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~mem38#1.base| v_ArrVal_4860) .cse0 v_ArrVal_4767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4860) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4767) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 18:23:53,130 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:23:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379320446] [2023-12-02 18:23:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379320446] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:23:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1357834942] [2023-12-02 18:23:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:23:53,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:23:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:23:53,132 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:23:53,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 18:23:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:23:56,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 18:23:56,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:23:56,959 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 [2023-12-02 18:23:56,963 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 [2023-12-02 18:23:57,356 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 18:23:57,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-12-02 18:23:57,378 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:23:57,378 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 [2023-12-02 18:23:57,425 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 15 treesize of output 1 [2023-12-02 18:23:57,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:23:57,507 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 17 treesize of output 9 [2023-12-02 18:23:57,552 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 7 treesize of output 3 [2023-12-02 18:23:58,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:23:58,080 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 16 treesize of output 11 [2023-12-02 18:23:58,311 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2023-12-02 18:23:58,321 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 27 treesize of output 22 [2023-12-02 18:23:58,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:23:58,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 18:23:58,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:23:58,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 18:23:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:23:58,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:23:58,859 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 239 treesize of output 167 [2023-12-02 18:24:06,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5333))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) (select |c_#length| v_arrayElimCell_68))) (let ((.cse1 (select (select (store .cse2 v_arrayElimCell_68 (store (select .cse2 v_arrayElimCell_68) (bvadd (_ bv16 32) .cse0) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5333))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (bvadd (select (select (store .cse8 v_arrayElimCell_68 (store (select .cse8 v_arrayElimCell_68) (bvadd (_ bv16 32) .cse4) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32))) (.cse5 (select |c_#length| v_arrayElimCell_68))) (or (not (bvule (bvadd .cse4 (_ bv20 32)) .cse5)) (bvule .cse6 .cse7) (bvule .cse6 .cse5)))))) (forall ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5333) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse9 (select .cse10 .cse3))) (or (not (bvule (bvadd .cse9 (_ bv20 32)) .cse7)) (not (= (bvadd (_ bv8 32) .cse9) |c_ULTIMATE.start_main_~user~0#1.offset|)) (bvule (bvadd (_ bv8 32) (select (store .cse10 (bvadd (_ bv16 32) .cse9) .cse3) .cse3)) .cse7))))) (forall ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5333))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= (bvadd (_ bv8 32) .cse11) |c_ULTIMATE.start_main_~user~0#1.offset|) (forall ((v_arrayElimCell_68 (_ BitVec 32))) (let ((.cse12 (select |c_#length| v_arrayElimCell_68))) (or (not (bvule (bvadd .cse11 (_ bv20 32)) .cse12)) (bvule (bvadd (select (select (store .cse13 v_arrayElimCell_68 (store (select .cse13 v_arrayElimCell_68) (bvadd (_ bv16 32) .cse11) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) .cse12)))))))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5333))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse15 (select |c_#length| v_arrayElimCell_68))) (or (not (bvule (bvadd .cse14 (_ bv20 32)) .cse15)) (bvule (bvadd (select (select (store .cse16 v_arrayElimCell_68 (store (select .cse16 v_arrayElimCell_68) (bvadd (_ bv16 32) .cse14) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) .cse15) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_68))))))) is different from false [2023-12-02 18:24:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1357834942] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:24:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726220683] [2023-12-02 18:24:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:24:06,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:24:06,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:24:06,682 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:24:06,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 18:24:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:24:07,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 18:24:07,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:24:07,384 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 [2023-12-02 18:24:07,850 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:24:07,851 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 [2023-12-02 18:24:07,864 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 [2023-12-02 18:24:08,078 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 [2023-12-02 18:24:08,110 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 [2023-12-02 18:24:08,563 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 [2023-12-02 18:24:08,571 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 [2023-12-02 18:24:09,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:24:09,860 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 [2023-12-02 18:24:09,878 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 [2023-12-02 18:24:10,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:24:10,345 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 [2023-12-02 18:24:10,355 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 [2023-12-02 18:24:10,391 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 [2023-12-02 18:24:10,405 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 [2023-12-02 18:24:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:24:10,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:24:10,509 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5802 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5802) |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_5803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 18:24:10,560 WARN L854 $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_5802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5802 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:24:12,379 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5895) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5894))) (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~mem38#1.base| v_ArrVal_5895) .cse2 v_ArrVal_5802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:24:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726220683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:24:12,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:24:12,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2023-12-02 18:24:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075467860] [2023-12-02 18:24:12,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:24:12,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 18:24:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:24:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 18:24:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=717, Unknown=8, NotChecked=420, Total=1260 [2023-12-02 18:24:12,397 INFO L87 Difference]: Start difference. First operand 1033 states and 1264 transitions. Second operand has 25 states, 21 states have (on average 8.904761904761905) internal successors, (187), 25 states have internal predecessors, (187), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:24:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:24:42,113 INFO L93 Difference]: Finished difference Result 1438 states and 1795 transitions. [2023-12-02 18:24:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:24:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 8.904761904761905) internal successors, (187), 25 states have internal predecessors, (187), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 110 [2023-12-02 18:24:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:24:42,120 INFO L225 Difference]: With dead ends: 1438 [2023-12-02 18:24:42,120 INFO L226 Difference]: Without dead ends: 1438 [2023-12-02 18:24:42,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 308 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=210, Invalid=1142, Unknown=8, NotChecked=532, Total=1892 [2023-12-02 18:24:42,121 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 1393 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 6546 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 6570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:24:42,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 2753 Invalid, 6570 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6546 Invalid, 0 Unknown, 0 Unchecked, 28.4s Time] [2023-12-02 18:24:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-12-02 18:24:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1032. [2023-12-02 18:24:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 661 states have (on average 1.8819969742813918) internal successors, (1244), 1024 states have internal predecessors, (1244), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:24:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1263 transitions. [2023-12-02 18:24:42,143 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1263 transitions. Word has length 110 [2023-12-02 18:24:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:24:42,143 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 1263 transitions. [2023-12-02 18:24:42,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 8.904761904761905) internal successors, (187), 25 states have internal predecessors, (187), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:24:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1263 transitions. [2023-12-02 18:24:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 18:24:42,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:24:42,145 INFO L195 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] [2023-12-02 18:24:42,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 18:24:42,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 18:24:42,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-02 18:24:42,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:24:42,746 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:24:42,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:24:42,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1766673317, now seen corresponding path program 1 times [2023-12-02 18:24:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:24:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567808143] [2023-12-02 18:24:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:24:42,747 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 [2023-12-02 18:24:42,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:24:42,748 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:24:42,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-02 18:24:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:24:43,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 18:24:43,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:24:43,687 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 [2023-12-02 18:24:44,015 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:24:44,016 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 [2023-12-02 18:24:44,088 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 [2023-12-02 18:24:44,288 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 [2023-12-02 18:24:45,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:24:45,961 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 [2023-12-02 18:24:46,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:24:46,208 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 [2023-12-02 18:24:46,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:24:46,380 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 [2023-12-02 18:24:46,403 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 [2023-12-02 18:24:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:24:46,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:24:48,722 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6335) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 18:24:48,747 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6335)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:24:48,773 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6335)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:24:49,390 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6381))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6334)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6335)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:24:49,397 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:24:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567808143] [2023-12-02 18:24:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567808143] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:24:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [857248124] [2023-12-02 18:24:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:24:49,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:24:49,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:24:49,399 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:24:49,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 18:25:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:25:14,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 18:25:14,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:25:14,772 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 [2023-12-02 18:25:15,464 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:25:15,465 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 [2023-12-02 18:25:15,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:25:15,912 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 20 treesize of output 12 [2023-12-02 18:25:17,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:25:17,537 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 36 treesize of output 35 [2023-12-02 18:25:17,865 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:25:17,865 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 36 treesize of output 35 [2023-12-02 18:25:18,071 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:25:18,071 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 36 treesize of output 35 [2023-12-02 18:25:18,109 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 27 treesize of output 15 [2023-12-02 18:25:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:25:18,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:25:18,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6821) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 18:25:18,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 18:25:18,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6820))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:25:18,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6820))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:25:18,851 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6867))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6820)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:25:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [857248124] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:25:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369825278] [2023-12-02 18:25:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:25:18,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:25:18,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:25:18,857 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:25:18,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 18:25:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:25:19,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 18:25:19,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:25:19,520 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 [2023-12-02 18:25:19,849 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:25:19,849 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 [2023-12-02 18:25:19,937 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 [2023-12-02 18:25:20,830 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:25:20,831 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 [2023-12-02 18:25:21,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:25:21,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:25:21,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:25:21,323 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 [2023-12-02 18:25:21,344 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 [2023-12-02 18:25:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:25:21,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:25:21,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 18:25:21,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7306) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:25:21,442 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 18:25:21,442 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 [2023-12-02 18:25:21,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7305 (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~mem40#1.base| v_ArrVal_7305))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7306)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem40#1.base|)) is different from false [2023-12-02 18:25:21,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7305 (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_7305))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7306)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 18:25:22,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7352)) (.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_7305))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7306)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 18:25:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369825278] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:25:22,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:25:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2023-12-02 18:25:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379729156] [2023-12-02 18:25:22,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:25:22,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 18:25:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:25:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 18:25:22,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=636, Unknown=17, NotChecked=910, Total=1722 [2023-12-02 18:25:22,118 INFO L87 Difference]: Start difference. First operand 1032 states and 1263 transitions. Second operand has 26 states, 22 states have (on average 6.545454545454546) internal successors, (144), 26 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:25:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:25:45,530 INFO L93 Difference]: Finished difference Result 1438 states and 1795 transitions. [2023-12-02 18:25:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 18:25:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 6.545454545454546) internal successors, (144), 26 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 112 [2023-12-02 18:25:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:25:45,537 INFO L225 Difference]: With dead ends: 1438 [2023-12-02 18:25:45,537 INFO L226 Difference]: Without dead ends: 1438 [2023-12-02 18:25:45,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=170, Invalid=681, Unknown=17, NotChecked=938, Total=1806 [2023-12-02 18:25:45,539 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 721 mSDsluCounter, 4663 mSDsCounter, 0 mSdLazyCounter, 5863 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 5072 SdHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:25:45,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 5072 Invalid, 5879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5863 Invalid, 0 Unknown, 0 Unchecked, 23.1s Time] [2023-12-02 18:25:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-12-02 18:25:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1031. [2023-12-02 18:25:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 661 states have (on average 1.880484114977307) internal successors, (1243), 1023 states have internal predecessors, (1243), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:25:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1262 transitions. [2023-12-02 18:25:45,561 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1262 transitions. Word has length 112 [2023-12-02 18:25:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:25:45,562 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1262 transitions. [2023-12-02 18:25:45,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 6.545454545454546) internal successors, (144), 26 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:25:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1262 transitions. [2023-12-02 18:25:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 18:25:45,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:25:45,563 INFO L195 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] [2023-12-02 18:25:45,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-12-02 18:25:45,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-12-02 18:25:45,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 18:25:46,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:25:46,164 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:25:46,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:25:46,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1766673316, now seen corresponding path program 1 times [2023-12-02 18:25:46,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:25:46,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121154281] [2023-12-02 18:25:46,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:25:46,165 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 [2023-12-02 18:25:46,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:25:46,166 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:25:46,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-02 18:25:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:25:47,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 18:25:47,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:25:47,101 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 [2023-12-02 18:25:47,716 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:25:47,716 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 [2023-12-02 18:25:47,730 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 [2023-12-02 18:25:47,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:25:47,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:25:48,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 18:25:48,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:25:49,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:25:49,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:25:49,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:25:49,679 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:25:49,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:25:49,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:25:49,882 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:25:49,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:25:49,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:25:49,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 18:25:49,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:25:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:25:50,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:25:50,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7839) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:25:50,342 WARN L854 $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_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7839) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:25:50,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7837))) (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~mem40#1.base| v_ArrVal_7836) .cse0 v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7839) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7836) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 18:25:50,500 WARN L854 $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_7839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7837))) (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_7836) .cse1 v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7839) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7836) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 18:25:52,420 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7930))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7931) .cse1 v_ArrVal_7836) (select (select (store .cse2 .cse1 v_ArrVal_7837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7838))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7930))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7837))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7931) .cse4 v_ArrVal_7836) .cse5 v_ArrVal_7838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7839) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 18:25:52,438 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:25:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121154281] [2023-12-02 18:25:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121154281] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:25:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [808286790] [2023-12-02 18:25:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:25:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:25:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:25:52,439 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:25:52,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 18:26:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:26:44,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 18:26:44,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:26:44,599 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 [2023-12-02 18:26:45,225 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:26:45,226 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 [2023-12-02 18:26:45,245 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 [2023-12-02 18:26:45,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:26:45,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:26:45,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 18:26:45,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:26:46,678 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:26:46,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:26:46,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:26:46,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:26:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:26:46,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:26:46,956 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:26:46,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 50 treesize of output 45 [2023-12-02 18:26:46,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:26:47,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 18:26:47,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:26:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:26:47,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:26:47,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:26:47,141 WARN L854 $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_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 18:26:47,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8416))) (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~mem40#1.base| v_ArrVal_8415) .cse0 v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8415) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8416) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 18:26:47,264 WARN L854 $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_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8416))) (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_8415) .cse1 v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8415) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8416) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 18:26:50,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8510))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8509) .cse1 v_ArrVal_8415) (select (select (store .cse2 .cse1 v_ArrVal_8416) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8418))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8510))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8416))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8509) .cse4 v_ArrVal_8415) .cse5 v_ArrVal_8418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 18:26:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [808286790] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:26:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402502941] [2023-12-02 18:26:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:26:50,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:26:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:26:50,124 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:26:50,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 18:26:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:26:50,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 18:26:50,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:26:50,853 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 [2023-12-02 18:26:51,202 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 [2023-12-02 18:26:51,235 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:26:51,235 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 [2023-12-02 18:26:51,345 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 [2023-12-02 18:26:51,369 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 [2023-12-02 18:26:51,672 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 [2023-12-02 18:26:51,681 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 [2023-12-02 18:26:53,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:26:53,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:26:53,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:26:53,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:26:53,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:26:53,346 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 [2023-12-02 18:26:53,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:26:53,560 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 [2023-12-02 18:26:53,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:26:53,608 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 [2023-12-02 18:26:53,622 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 [2023-12-02 18:26:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:26:53,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:26:53,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8996) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:26:53,756 WARN L854 $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_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8996) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 18:26:53,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8995))) (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~mem40#1.base| v_ArrVal_8994) .cse0 v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8996) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8994) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2023-12-02 18:26:53,889 WARN L854 $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_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8994) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8995))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8994) .cse3 v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8996) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 18:26:56,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9089))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8995))) (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~mem38#1.base| v_ArrVal_9088) .cse0 v_ArrVal_8994) .cse1 v_ArrVal_8997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8996) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9089))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9088) .cse6 v_ArrVal_8994) (select (select (store .cse7 .cse6 v_ArrVal_8995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8997))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 18:26:56,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402502941] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:26:56,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:26:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 18:26:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810306033] [2023-12-02 18:26:56,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:26:56,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 18:26:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:26:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 18:26:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 18:26:56,342 INFO L87 Difference]: Start difference. First operand 1031 states and 1262 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 18:27:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:27:18,136 INFO L93 Difference]: Finished difference Result 1436 states and 1793 transitions. [2023-12-02 18:27:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:27:18,136 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-12-02 18:27:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:27:18,140 INFO L225 Difference]: With dead ends: 1436 [2023-12-02 18:27:18,140 INFO L226 Difference]: Without dead ends: 1436 [2023-12-02 18:27:18,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 18:27:18,141 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 716 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 5146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:27:18,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2474 Invalid, 5146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 21.1s Time] [2023-12-02 18:27:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2023-12-02 18:27:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1030. [2023-12-02 18:27:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 661 states have (on average 1.8789712556732223) internal successors, (1242), 1022 states have internal predecessors, (1242), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 18:27:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1261 transitions. [2023-12-02 18:27:18,160 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1261 transitions. Word has length 112 [2023-12-02 18:27:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:27:18,161 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1261 transitions. [2023-12-02 18:27:18,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 18:27:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1261 transitions. [2023-12-02 18:27:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 18:27:18,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:27:18,162 INFO L195 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] [2023-12-02 18:27:18,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 18:27:18,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 18:27:18,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-02 18:27:18,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:27:18,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 18:27:18,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:27:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1259607676, now seen corresponding path program 1 times [2023-12-02 18:27:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:27:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053638138] [2023-12-02 18:27:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:27:18,765 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 [2023-12-02 18:27:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:27:18,765 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 18:27:18,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-02 18:27:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:27:20,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 18:27:20,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:27:20,042 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 [2023-12-02 18:27:20,357 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 [2023-12-02 18:27:20,389 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:27:20,389 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 [2023-12-02 18:27:20,441 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 [2023-12-02 18:27:20,471 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 [2023-12-02 18:27:20,655 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 [2023-12-02 18:27:20,663 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 [2023-12-02 18:27:22,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:27:22,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:27:22,039 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 [2023-12-02 18:27:22,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:27:22,250 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 [2023-12-02 18:27:22,260 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 [2023-12-02 18:27:22,446 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:27:22,446 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 [2023-12-02 18:27:22,470 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 [2023-12-02 18:27:22,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:27:22,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:27:22,664 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 [2023-12-02 18:27:22,686 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 [2023-12-02 18:27:22,701 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 [2023-12-02 18:27:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:27:22,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:27:23,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:27:23,102 WARN L854 $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_9592 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:27:23,208 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9590) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9591))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9590) .cse2 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:27:32,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9589 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9588 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9589))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9588) .cse2 v_ArrVal_9590) (select (select (store .cse3 .cse2 v_ArrVal_9591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9592))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9589 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9588 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9589))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9591))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9588) .cse5 v_ArrVal_9590) .cse6 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 18:27:37,865 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9589 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9588 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9685 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9685))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9589))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9684) .cse1 v_ArrVal_9588) .cse2 v_ArrVal_9590) (select (select (store .cse3 .cse2 v_ArrVal_9591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9592))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9589 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9588 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9685 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9685))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9589))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9591))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9684) .cse6 v_ArrVal_9588) .cse7 v_ArrVal_9590) .cse8 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 18:27:37,903 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:27:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053638138] [2023-12-02 18:27:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053638138] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:27:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1204385515] [2023-12-02 18:27:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:27:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:27:37,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:27:37,904 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:27:37,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 18:33:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:33:17,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 18:33:17,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:33:17,524 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 [2023-12-02 18:33:19,728 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 [2023-12-02 18:33:19,835 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:33:19,835 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 [2023-12-02 18:33:20,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:33:20,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:33:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 18:33:21,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:33:25,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:33:25,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:33:25,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:33:26,377 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:33:26,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:33:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:33:27,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:33:27,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 50 treesize of output 45 [2023-12-02 18:33:27,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:33:27,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:33:27,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:33:27,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:33:27,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 18:33:27,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:33:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:33:27,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:33:28,203 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:33:28,326 WARN L854 $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_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 18:33:32,128 WARN L854 $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_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10186))) (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_10187) .cse1 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10187) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 18:33:32,775 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10184))) (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~mem40#1.base| v_ArrVal_10185) .cse1 v_ArrVal_10187) (select (select (store .cse2 .cse1 v_ArrVal_10186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10189))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10184))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10186))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10185) .cse4 v_ArrVal_10187) .cse5 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 18:33:34,931 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10184))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10186))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10185) .cse1 v_ArrVal_10187) .cse2 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10184))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10185) .cse7 v_ArrVal_10187) (select (select (store .cse8 .cse7 v_ArrVal_10186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10189))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 18:33:40,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10280))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10184))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10186))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10281) .cse0 v_ArrVal_10185) .cse1 v_ArrVal_10187) .cse2 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10280))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10184))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10281) .cse8 v_ArrVal_10185) .cse9 v_ArrVal_10187) (select (select (store .cse10 .cse9 v_ArrVal_10186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10189))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 18:33:40,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1204385515] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:33:40,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857392427] [2023-12-02 18:33:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:33:40,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:33:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:33:40,208 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:33:40,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0079de6e-05eb-490b-95cf-48861e8e9748/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 18:33:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:33:40,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 18:33:40,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:33:40,996 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 [2023-12-02 18:33:42,016 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:33:42,016 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 [2023-12-02 18:33:42,055 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 [2023-12-02 18:33:42,119 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 [2023-12-02 18:33:42,203 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 [2023-12-02 18:33:42,438 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 [2023-12-02 18:33:42,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:33:46,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:33:46,405 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 [2023-12-02 18:33:46,429 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 [2023-12-02 18:33:46,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:33:46,836 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 [2023-12-02 18:33:46,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:33:47,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:33:47,133 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 [2023-12-02 18:33:47,177 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 [2023-12-02 18:33:47,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:33:47,428 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 [2023-12-02 18:33:47,490 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 [2023-12-02 18:33:47,536 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 [2023-12-02 18:33:47,577 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 [2023-12-02 18:33:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:33:47,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:33:47,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 18:33:47,889 WARN L854 $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_10784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:33:48,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10783) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10782))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10783) .cse2 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:33:48,136 WARN L854 $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_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10782))) (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_10783) .cse1 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10783) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 18:33:59,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10781))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10780) .cse2 v_ArrVal_10783) (select (select (store .cse3 .cse2 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10784))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10781))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10782))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10780) .cse5 v_ArrVal_10783) .cse6 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 18:34:03,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10876))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10781))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10782))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10877) .cse0 v_ArrVal_10780) .cse1 v_ArrVal_10783) .cse2 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10876))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10781))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10877) .cse8 v_ArrVal_10780) .cse9 v_ArrVal_10783) (select (select (store .cse10 .cse9 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10784))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 18:34:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857392427] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:34:03,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:34:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2023-12-02 18:34:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799655553] [2023-12-02 18:34:03,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:34:03,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 18:34:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:34:03,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 18:34:03,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=485, Unknown=55, NotChecked=1054, Total=1722 [2023-12-02 18:34:03,772 INFO L87 Difference]: Start difference. First operand 1030 states and 1261 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)