./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/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 eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:35:16,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:35:16,685 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 13:35:16,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:35:16,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:35:16,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:35:16,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:35:16,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:35:16,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:35:16,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:35:16,718 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:35:16,719 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:35:16,719 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:35:16,720 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:35:16,720 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:35:16,721 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:35:16,721 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:35:16,722 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:35:16,722 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:35:16,723 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:35:16,723 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:35:16,724 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:35:16,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:35:16,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:35:16,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:35:16,726 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:35:16,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:35:16,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:35:16,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:35:16,727 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:35:16,728 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:35:16,728 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:35:16,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:35:16,729 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:35:16,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:35:16,729 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:35:16,730 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:35:16,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:35:16,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:35:16,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:35:16,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:35:16,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:35:16,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:35:16,731 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:35:16,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:35:16,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:35:16,732 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:35:16,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:35:16,732 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_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/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 -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2023-12-02 13:35:16,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:35:16,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:35:16,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:35:16,952 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:35:16,953 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:35:16,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2023-12-02 13:35:19,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:35:19,894 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:35:19,895 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2023-12-02 13:35:19,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data/a84c6cec4/744d8ec3afc44d6a95ad25d8901a2022/FLAG0fbe4b5e9 [2023-12-02 13:35:19,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data/a84c6cec4/744d8ec3afc44d6a95ad25d8901a2022 [2023-12-02 13:35:19,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:35:19,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:35:19,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:35:19,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:35:19,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:35:19,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:19" (1/1) ... [2023-12-02 13:35:19,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555cffae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:19, skipping insertion in model container [2023-12-02 13:35:19,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:19" (1/1) ... [2023-12-02 13:35:20,018 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:35:20,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:20,507 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 13:35:20,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3df8179d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:20, skipping insertion in model container [2023-12-02 13:35:20,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:35:20,508 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 13:35:20,510 INFO L158 Benchmark]: Toolchain (without parser) took 579.23ms. Allocated memory is still 146.8MB. Free memory was 112.9MB in the beginning and 93.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 13:35:20,510 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:35:20,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.95ms. Allocated memory is still 146.8MB. Free memory was 112.4MB in the beginning and 93.2MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 13:35:20,512 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.14ms. Allocated memory is still 104.9MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.95ms. Allocated memory is still 146.8MB. Free memory was 112.4MB in the beginning and 93.2MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/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 eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:35:22,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:35:22,282 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 13:35:22,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:35:22,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:35:22,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:35:22,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:35:22,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:35:22,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:35:22,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:35:22,320 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:35:22,320 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:35:22,321 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:35:22,321 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:35:22,322 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:35:22,323 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:35:22,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:35:22,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:35:22,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:35:22,325 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:35:22,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:35:22,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:35:22,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:35:22,327 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:35:22,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:35:22,328 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:35:22,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:35:22,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:35:22,329 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 13:35:22,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 13:35:22,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:35:22,330 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:35:22,331 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:35:22,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:35:22,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 13:35:22,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:35:22,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:35:22,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:35:22,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:35:22,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:35:22,333 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 13:35:22,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 13:35:22,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:35:22,334 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:35:22,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:35:22,334 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_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/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 -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2023-12-02 13:35:22,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:35:22,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:35:22,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:35:22,657 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:35:22,658 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:35:22,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2023-12-02 13:35:25,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:35:25,693 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:35:25,694 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2023-12-02 13:35:25,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data/4788b3af4/8abb7c2c666f4235af51bae8d06a0c4f/FLAG89f4fe28e [2023-12-02 13:35:25,725 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/data/4788b3af4/8abb7c2c666f4235af51bae8d06a0c4f [2023-12-02 13:35:25,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:35:25,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:35:25,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:35:25,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:35:25,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:35:25,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:25" (1/1) ... [2023-12-02 13:35:25,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0d3501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:25, skipping insertion in model container [2023-12-02 13:35:25,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:25" (1/1) ... [2023-12-02 13:35:25,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:35:26,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:26,304 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 13:35:26,320 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:35:26,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:26,408 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:35:26,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:35:26,505 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:35:26,512 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:35:26,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26 WrapperNode [2023-12-02 13:35:26,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:35:26,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:35:26,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:35:26,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:35:26,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,602 INFO L138 Inliner]: procedures = 180, calls = 287, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1047 [2023-12-02 13:35:26,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:35:26,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:35:26,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:35:26,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:35:26,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:35:26,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:35:26,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:35:26,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:35:26,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (1/1) ... [2023-12-02 13:35:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:35:26,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:35:26,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:35:26,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:35:26,805 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 13:35:26,805 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 13:35:26,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 13:35:26,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 13:35:26,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 13:35:26,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 13:35:26,806 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 13:35:26,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 13:35:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:35:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 13:35:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 13:35:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:35:26,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:35:26,995 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:35:26,997 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:35:27,017 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 13:35:31,200 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:35:31,368 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:35:31,368 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 13:35:31,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:31 BoogieIcfgContainer [2023-12-02 13:35:31,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:35:31,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:35:31,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:35:31,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:35:31,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:35:25" (1/3) ... [2023-12-02 13:35:31,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee9024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:31, skipping insertion in model container [2023-12-02 13:35:31,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:26" (2/3) ... [2023-12-02 13:35:31,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee9024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:31, skipping insertion in model container [2023-12-02 13:35:31,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:31" (3/3) ... [2023-12-02 13:35:31,377 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2023-12-02 13:35:31,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:35:31,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 533 error locations. [2023-12-02 13:35:31,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:35:31,475 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;@3e0bd1f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:35:31,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 533 error locations. [2023-12-02 13:35:31,482 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 13:35:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:35:31,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:31,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:35:31,489 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 13:35:31,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 54582, now seen corresponding path program 1 times [2023-12-02 13:35:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73903746] [2023-12-02 13:35:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:31,507 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 13:35:31,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:31,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:31,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:31,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:31,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:31,717 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 13:35:31,729 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 13:35:31,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:31,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73903746] [2023-12-02 13:35:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73903746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:31,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:35:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599616692] [2023-12-02 13:35:31,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:31,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:31,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:31,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:31,764 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 13:35:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:33,418 INFO L93 Difference]: Finished difference Result 974 states and 1039 transitions. [2023-12-02 13:35:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:33,420 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 13:35:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:33,437 INFO L225 Difference]: With dead ends: 974 [2023-12-02 13:35:33,437 INFO L226 Difference]: Without dead ends: 973 [2023-12-02 13:35:33,439 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 13:35:33,441 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 901 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:33,442 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.6s Time] [2023-12-02 13:35:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2023-12-02 13:35:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 964. [2023-12-02 13:35:33,510 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 13:35:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1030 transitions. [2023-12-02 13:35:33,516 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1030 transitions. Word has length 2 [2023-12-02 13:35:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:33,517 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1030 transitions. [2023-12-02 13:35:33,517 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 13:35:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1030 transitions. [2023-12-02 13:35:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:35:33,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:33,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:35:33,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:33,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:33,720 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 13:35:33,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 54583, now seen corresponding path program 1 times [2023-12-02 13:35:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457240465] [2023-12-02 13:35:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:33,722 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 13:35:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:33,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:33,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:33,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:33,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:33,830 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 13:35:33,841 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 13:35:33,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:33,842 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:33,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457240465] [2023-12-02 13:35:33,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457240465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:33,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:35:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604924978] [2023-12-02 13:35:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:33,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:33,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:33,845 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 13:35:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:37,001 INFO L93 Difference]: Finished difference Result 1339 states and 1446 transitions. [2023-12-02 13:35:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:37,002 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 13:35:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:37,007 INFO L225 Difference]: With dead ends: 1339 [2023-12-02 13:35:37,007 INFO L226 Difference]: Without dead ends: 1339 [2023-12-02 13:35:37,008 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 13:35:37,009 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 405 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:37,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1260 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 13:35:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2023-12-02 13:35:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1133. [2023-12-02 13:35:37,037 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 13:35:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1411 transitions. [2023-12-02 13:35:37,043 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1411 transitions. Word has length 2 [2023-12-02 13:35:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:37,043 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1411 transitions. [2023-12-02 13:35:37,044 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 13:35:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1411 transitions. [2023-12-02 13:35:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 13:35:37,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:37,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 13:35:37,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:37,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:37,245 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 13:35:37,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1132069568, now seen corresponding path program 1 times [2023-12-02 13:35:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124544233] [2023-12-02 13:35:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:37,247 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 13:35:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:37,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:37,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:37,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:35:37,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:37,362 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 13:35:37,369 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 13:35:37,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:35:37,438 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 13:35:37,457 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:35:37,458 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 13:35:37,480 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 13:35:37,480 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:37,480 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124544233] [2023-12-02 13:35:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124544233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:37,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968632978] [2023-12-02 13:35:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:37,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:37,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:37,483 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 13:35:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:40,044 INFO L93 Difference]: Finished difference Result 1136 states and 1416 transitions. [2023-12-02 13:35:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:40,044 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 13:35:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:40,049 INFO L225 Difference]: With dead ends: 1136 [2023-12-02 13:35:40,049 INFO L226 Difference]: Without dead ends: 1136 [2023-12-02 13:35:40,049 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 13:35:40,050 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 13:35:40,050 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 13:35:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-02 13:35:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 953. [2023-12-02 13:35:40,069 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 13:35:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1018 transitions. [2023-12-02 13:35:40,074 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1018 transitions. Word has length 6 [2023-12-02 13:35:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:40,075 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1018 transitions. [2023-12-02 13:35:40,075 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 13:35:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1018 transitions. [2023-12-02 13:35:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:35:40,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:40,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:40,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:40,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:40,277 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 13:35:40,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash -734418257, now seen corresponding path program 1 times [2023-12-02 13:35:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480217011] [2023-12-02 13:35:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:40,279 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 13:35:40,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:40,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:40,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:40,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:40,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:40,399 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 13:35:40,429 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 13:35:40,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:40,430 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:40,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480217011] [2023-12-02 13:35:40,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480217011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203705374] [2023-12-02 13:35:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:40,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:40,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:40,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:40,431 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 13:35:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:42,306 INFO L93 Difference]: Finished difference Result 1247 states and 1342 transitions. [2023-12-02 13:35:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:42,307 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 13:35:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:42,313 INFO L225 Difference]: With dead ends: 1247 [2023-12-02 13:35:42,313 INFO L226 Difference]: Without dead ends: 1247 [2023-12-02 13:35:42,313 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 13:35:42,314 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 895 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:42,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1003 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 13:35:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-12-02 13:35:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 904. [2023-12-02 13:35:42,328 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 13:35:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 969 transitions. [2023-12-02 13:35:42,338 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 969 transitions. Word has length 7 [2023-12-02 13:35:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:42,338 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 969 transitions. [2023-12-02 13:35:42,338 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 13:35:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 969 transitions. [2023-12-02 13:35:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:35:42,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:42,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:42,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:42,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:42,541 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 13:35:42,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash -734418256, now seen corresponding path program 1 times [2023-12-02 13:35:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:42,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185862256] [2023-12-02 13:35:42,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:42,543 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 13:35:42,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:42,543 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:42,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:42,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:42,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:42,636 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 13:35:42,658 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 13:35:42,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:42,659 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185862256] [2023-12-02 13:35:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185862256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:42,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:42,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:35:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855920660] [2023-12-02 13:35:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:42,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:42,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:42,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:42,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:42,660 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 13:35:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:45,395 INFO L93 Difference]: Finished difference Result 1317 states and 1415 transitions. [2023-12-02 13:35:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:45,397 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 13:35:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:45,402 INFO L225 Difference]: With dead ends: 1317 [2023-12-02 13:35:45,402 INFO L226 Difference]: Without dead ends: 1317 [2023-12-02 13:35:45,402 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 13:35:45,403 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 613 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:45,403 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.7s Time] [2023-12-02 13:35:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-12-02 13:35:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 917. [2023-12-02 13:35:45,418 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 13:35:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1016 transitions. [2023-12-02 13:35:45,420 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1016 transitions. Word has length 7 [2023-12-02 13:35:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:45,421 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1016 transitions. [2023-12-02 13:35:45,421 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 13:35:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1016 transitions. [2023-12-02 13:35:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:35:45,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:45,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:45,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Forceful destruction successful, exit code 0 [2023-12-02 13:35:45,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:45,622 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 13:35:45,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1228521271, now seen corresponding path program 1 times [2023-12-02 13:35:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231212132] [2023-12-02 13:35:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:45,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:35:45,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:45,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:45,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:45,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:35:45,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:45,804 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 13:35:45,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:45,804 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231212132] [2023-12-02 13:35:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231212132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146854519] [2023-12-02 13:35:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:45,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:45,806 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 13:35:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:47,418 INFO L93 Difference]: Finished difference Result 1325 states and 1458 transitions. [2023-12-02 13:35:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:35:47,420 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 13:35:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:47,425 INFO L225 Difference]: With dead ends: 1325 [2023-12-02 13:35:47,425 INFO L226 Difference]: Without dead ends: 1325 [2023-12-02 13:35:47,426 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 13:35:47,426 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 13:35:47,427 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 13:35:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2023-12-02 13:35:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1117. [2023-12-02 13:35:47,449 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 13:35:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1431 transitions. [2023-12-02 13:35:47,454 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1431 transitions. Word has length 10 [2023-12-02 13:35:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:47,454 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1431 transitions. [2023-12-02 13:35:47,454 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 13:35:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1431 transitions. [2023-12-02 13:35:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:35:47,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:47,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:47,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:35:47,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:47,656 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 13:35:47,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 570547524, now seen corresponding path program 1 times [2023-12-02 13:35:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675238274] [2023-12-02 13:35:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:47,657 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 13:35:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:47,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:47,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:47,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:47,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:47,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:35:47,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:35:47,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:35:47,793 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 13:35:47,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:35:47,841 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 13:35:47,853 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 13:35:47,854 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:47,854 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675238274] [2023-12-02 13:35:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675238274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:47,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:35:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768738674] [2023-12-02 13:35:47,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:47,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:47,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:47,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:47,856 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 13:35:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:49,764 INFO L93 Difference]: Finished difference Result 1464 states and 1849 transitions. [2023-12-02 13:35:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:49,765 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 13:35:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:49,770 INFO L225 Difference]: With dead ends: 1464 [2023-12-02 13:35:49,771 INFO L226 Difference]: Without dead ends: 1464 [2023-12-02 13:35:49,771 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 13:35:49,771 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.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:49,772 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.9s Time] [2023-12-02 13:35:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2023-12-02 13:35:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1116. [2023-12-02 13:35:49,797 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 13:35:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1429 transitions. [2023-12-02 13:35:49,801 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1429 transitions. Word has length 11 [2023-12-02 13:35:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:49,802 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1429 transitions. [2023-12-02 13:35:49,802 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 13:35:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1429 transitions. [2023-12-02 13:35:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:35:49,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:49,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:35:49,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Forceful destruction successful, exit code 0 [2023-12-02 13:35:50,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:50,008 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 13:35:50,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 661679463, now seen corresponding path program 1 times [2023-12-02 13:35:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455620657] [2023-12-02 13:35:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:50,008 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 13:35:50,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:50,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:50,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:50,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:35:50,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:50,155 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 13:35:50,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:50,156 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455620657] [2023-12-02 13:35:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455620657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131391113] [2023-12-02 13:35:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:35:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:35:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:35:50,157 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 13:35:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:50,944 INFO L93 Difference]: Finished difference Result 1062 states and 1349 transitions. [2023-12-02 13:35:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:35:50,946 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 13:35:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:50,950 INFO L225 Difference]: With dead ends: 1062 [2023-12-02 13:35:50,950 INFO L226 Difference]: Without dead ends: 1062 [2023-12-02 13:35:50,950 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 13:35:50,951 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 70 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:50,951 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.8s Time] [2023-12-02 13:35:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2023-12-02 13:35:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2023-12-02 13:35:50,968 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 13:35:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1349 transitions. [2023-12-02 13:35:50,985 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1349 transitions. Word has length 15 [2023-12-02 13:35:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:50,985 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1349 transitions. [2023-12-02 13:35:50,986 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 13:35:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1349 transitions. [2023-12-02 13:35:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 13:35:50,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:50,986 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 13:35:50,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:51,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:51,188 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 13:35:51,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 218799840, now seen corresponding path program 1 times [2023-12-02 13:35:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752157506] [2023-12-02 13:35:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:51,189 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 13:35:51,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:51,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:51,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:51,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:35:51,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:51,359 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 13:35:51,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:51,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752157506] [2023-12-02 13:35:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752157506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:51,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:35:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221474159] [2023-12-02 13:35:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:51,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:51,362 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 13:35:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:52,293 INFO L93 Difference]: Finished difference Result 1048 states and 1307 transitions. [2023-12-02 13:35:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:52,294 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 13:35:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:52,298 INFO L225 Difference]: With dead ends: 1048 [2023-12-02 13:35:52,298 INFO L226 Difference]: Without dead ends: 1048 [2023-12-02 13:35:52,299 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 13:35:52,299 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 13:35:52,299 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 13:35:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-12-02 13:35:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2023-12-02 13:35:52,316 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 13:35:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1305 transitions. [2023-12-02 13:35:52,320 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1305 transitions. Word has length 17 [2023-12-02 13:35:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:52,321 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1305 transitions. [2023-12-02 13:35:52,321 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 13:35:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1305 transitions. [2023-12-02 13:35:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:35:52,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:52,322 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 13:35:52,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:35:52,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:52,523 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 13:35:52,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -195365074, now seen corresponding path program 1 times [2023-12-02 13:35:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201128309] [2023-12-02 13:35:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:52,524 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 13:35:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:52,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:52,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:52,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:35:52,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:52,662 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 13:35:52,737 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 13:35:52,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:52,738 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201128309] [2023-12-02 13:35:52,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201128309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:52,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:52,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749826245] [2023-12-02 13:35:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:52,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:52,740 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 13:35:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:55,212 INFO L93 Difference]: Finished difference Result 1448 states and 1829 transitions. [2023-12-02 13:35:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:55,212 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 13:35:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:55,218 INFO L225 Difference]: With dead ends: 1448 [2023-12-02 13:35:55,218 INFO L226 Difference]: Without dead ends: 1448 [2023-12-02 13:35:55,218 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 13:35:55,219 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 828 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:55,219 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.4s Time] [2023-12-02 13:35:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2023-12-02 13:35:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1042. [2023-12-02 13:35:55,238 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 13:35:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1297 transitions. [2023-12-02 13:35:55,242 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1297 transitions. Word has length 31 [2023-12-02 13:35:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:55,242 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1297 transitions. [2023-12-02 13:35:55,242 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 13:35:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1297 transitions. [2023-12-02 13:35:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:35:55,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:55,243 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 13:35:55,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:55,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:55,444 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 13:35:55,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -195365073, now seen corresponding path program 1 times [2023-12-02 13:35:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936113544] [2023-12-02 13:35:55,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:55,445 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 13:35:55,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:55,446 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:55,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:35:55,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:35:55,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:35:55,594 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 13:35:55,765 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 13:35:55,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:35:55,766 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:35:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936113544] [2023-12-02 13:35:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936113544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:35:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:35:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:35:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360098381] [2023-12-02 13:35:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:35:55,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:35:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:35:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:35:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:35:55,767 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 13:35:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:35:59,601 INFO L93 Difference]: Finished difference Result 1566 states and 1972 transitions. [2023-12-02 13:35:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:35:59,603 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 13:35:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:35:59,609 INFO L225 Difference]: With dead ends: 1566 [2023-12-02 13:35:59,609 INFO L226 Difference]: Without dead ends: 1566 [2023-12-02 13:35:59,609 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 13:35:59,610 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 548 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:35:59,610 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.8s Time] [2023-12-02 13:35:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2023-12-02 13:35:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1038. [2023-12-02 13:35:59,632 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 13:35:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1289 transitions. [2023-12-02 13:35:59,636 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1289 transitions. Word has length 31 [2023-12-02 13:35:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:35:59,636 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1289 transitions. [2023-12-02 13:35:59,637 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 13:35:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1289 transitions. [2023-12-02 13:35:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 13:35:59,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:35:59,639 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 13:35:59,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:59,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:59,842 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 13:35:59,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:35:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1055920008, now seen corresponding path program 1 times [2023-12-02 13:35:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:35:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001854201] [2023-12-02 13:35:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:35:59,844 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 13:35:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:35:59,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:35:59,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:00,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:36:00,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:00,113 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 13:36:00,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:00,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001854201] [2023-12-02 13:36:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001854201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114056297] [2023-12-02 13:36:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:00,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:36:00,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:00,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:36:00,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:36:00,115 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 13:36:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:01,063 INFO L93 Difference]: Finished difference Result 1026 states and 1269 transitions. [2023-12-02 13:36:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:36:01,065 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 13:36:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:01,070 INFO L225 Difference]: With dead ends: 1026 [2023-12-02 13:36:01,070 INFO L226 Difference]: Without dead ends: 1026 [2023-12-02 13:36:01,070 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 13:36:01,071 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, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:01,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2260 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 13:36:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-12-02 13:36:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2023-12-02 13:36:01,087 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 13:36:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1269 transitions. [2023-12-02 13:36:01,091 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1269 transitions. Word has length 50 [2023-12-02 13:36:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:01,091 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1269 transitions. [2023-12-02 13:36:01,091 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 13:36:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1269 transitions. [2023-12-02 13:36:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 13:36:01,093 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:01,093 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 13:36:01,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:01,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:01,299 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 13:36:01,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash 566526599, now seen corresponding path program 1 times [2023-12-02 13:36:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:01,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325441147] [2023-12-02 13:36:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:01,301 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 13:36:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:01,302 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:01,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:01,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:36:01,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:01,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:36:01,655 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 13:36:02,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:36:02,118 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 13:36:02,132 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:36:02,133 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 13:36:02,143 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 13:36:02,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:02,143 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:02,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325441147] [2023-12-02 13:36:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325441147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:02,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:36:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531722526] [2023-12-02 13:36:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:02,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:36:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:36:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:36:02,145 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 13:36:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:04,934 INFO L93 Difference]: Finished difference Result 1394 states and 1763 transitions. [2023-12-02 13:36:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:36:04,935 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 13:36:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:04,940 INFO L225 Difference]: With dead ends: 1394 [2023-12-02 13:36:04,940 INFO L226 Difference]: Without dead ends: 1394 [2023-12-02 13:36:04,940 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 13:36:04,941 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1806 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:04,941 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.8s Time] [2023-12-02 13:36:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2023-12-02 13:36:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 965. [2023-12-02 13:36:04,952 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 13:36:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1174 transitions. [2023-12-02 13:36:04,956 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1174 transitions. Word has length 54 [2023-12-02 13:36:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:04,956 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1174 transitions. [2023-12-02 13:36:04,956 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 13:36:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1174 transitions. [2023-12-02 13:36:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 13:36:04,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:04,958 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 13:36:04,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:05,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:05,158 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 13:36:05,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash 521436340, now seen corresponding path program 1 times [2023-12-02 13:36:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660856751] [2023-12-02 13:36:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:05,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:36:05,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:05,161 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:05,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:05,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:36:05,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:05,401 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 13:36:05,413 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 13:36:05,435 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 13:36:05,445 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 13:36:05,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:05,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:05,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660856751] [2023-12-02 13:36:05,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660856751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:05,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:05,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:05,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593600688] [2023-12-02 13:36:05,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:05,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:36:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:36:05,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:36:05,447 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 13:36:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:08,259 INFO L93 Difference]: Finished difference Result 964 states and 1173 transitions. [2023-12-02 13:36:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:36:08,260 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 13:36:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:08,265 INFO L225 Difference]: With dead ends: 964 [2023-12-02 13:36:08,265 INFO L226 Difference]: Without dead ends: 964 [2023-12-02 13:36:08,265 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 13:36:08,265 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 13:36:08,265 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 13:36:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-02 13:36:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2023-12-02 13:36:08,276 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 13:36:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1173 transitions. [2023-12-02 13:36:08,278 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1173 transitions. Word has length 58 [2023-12-02 13:36:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:08,279 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1173 transitions. [2023-12-02 13:36:08,279 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 13:36:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1173 transitions. [2023-12-02 13:36:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 13:36:08,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:08,280 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 13:36:08,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Forceful destruction successful, exit code 0 [2023-12-02 13:36:08,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:08,480 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 13:36:08,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 521436341, now seen corresponding path program 1 times [2023-12-02 13:36:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280019858] [2023-12-02 13:36:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:36:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:08,482 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:08,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:08,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 13:36:08,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:08,732 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 13:36:08,750 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 13:36:08,759 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 13:36:08,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 13:36:08,811 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 13:36:08,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:08,812 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280019858] [2023-12-02 13:36:08,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280019858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:08,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:08,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763266081] [2023-12-02 13:36:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:08,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:36:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:08,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:36:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:36:08,813 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 13:36:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:12,138 INFO L93 Difference]: Finished difference Result 963 states and 1172 transitions. [2023-12-02 13:36:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:36:12,140 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 13:36:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:12,144 INFO L225 Difference]: With dead ends: 963 [2023-12-02 13:36:12,144 INFO L226 Difference]: Without dead ends: 963 [2023-12-02 13:36:12,144 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 13:36:12,144 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 1 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:12,145 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.3s Time] [2023-12-02 13:36:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-12-02 13:36:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2023-12-02 13:36:12,160 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 13:36:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1172 transitions. [2023-12-02 13:36:12,162 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1172 transitions. Word has length 58 [2023-12-02 13:36:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:12,162 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1172 transitions. [2023-12-02 13:36:12,162 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 13:36:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1172 transitions. [2023-12-02 13:36:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 13:36:12,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:12,163 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 13:36:12,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:12,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:12,364 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 13:36:12,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 411489050, now seen corresponding path program 1 times [2023-12-02 13:36:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733458551] [2023-12-02 13:36:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:12,365 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 13:36:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:12,366 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:12,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:12,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:36:12,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:12,634 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 13:36:12,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:36:12,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:12,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733458551] [2023-12-02 13:36:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733458551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:36:12,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:36:12,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:36:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385625163] [2023-12-02 13:36:12,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:36:12,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:36:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:12,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:36:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:36:12,636 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 13:36:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:13,539 INFO L93 Difference]: Finished difference Result 965 states and 1175 transitions. [2023-12-02 13:36:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:36:13,541 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 13:36:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:13,547 INFO L225 Difference]: With dead ends: 965 [2023-12-02 13:36:13,547 INFO L226 Difference]: Without dead ends: 965 [2023-12-02 13:36:13,547 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 13:36:13,548 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 13:36:13,548 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 13:36:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-12-02 13:36:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2023-12-02 13:36:13,563 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 13:36:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1175 transitions. [2023-12-02 13:36:13,565 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1175 transitions. Word has length 64 [2023-12-02 13:36:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:13,565 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1175 transitions. [2023-12-02 13:36:13,565 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 13:36:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1175 transitions. [2023-12-02 13:36:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 13:36:13,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:13,566 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 13:36:13,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:13,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:13,768 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 13:36:13,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1894795278, now seen corresponding path program 1 times [2023-12-02 13:36:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057242541] [2023-12-02 13:36:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:13,768 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 13:36:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:13,769 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:13,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:14,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:36:14,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:14,056 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 13:36:14,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:14,119 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 13:36:14,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057242541] [2023-12-02 13:36:14,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057242541] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1292574171] [2023-12-02 13:36:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:14,120 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:36:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:36:14,120 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:36:14,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-02 13:36:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:14,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:36:14,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:14,539 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 13:36:14,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:14,565 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 13:36:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1292574171] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992007387] [2023-12-02 13:36:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:36:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:36:14,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:36:14,566 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:36:14,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 13:36:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:36:14,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:36:14,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:14,837 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 13:36:14,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:14,863 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 13:36:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992007387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:14,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:36:14,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 13:36:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061098354] [2023-12-02 13:36:14,864 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:36:14,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:36:14,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:36:14,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:36:14,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:36:14,866 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 13:36:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:36:16,777 INFO L93 Difference]: Finished difference Result 974 states and 1189 transitions. [2023-12-02 13:36:16,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:36:16,778 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 13:36:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:36:16,782 INFO L225 Difference]: With dead ends: 974 [2023-12-02 13:36:16,782 INFO L226 Difference]: Without dead ends: 974 [2023-12-02 13:36:16,782 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 13:36:16,783 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 6 mSDsluCounter, 4386 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:36:16,783 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.8s Time] [2023-12-02 13:36:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-02 13:36:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 973. [2023-12-02 13:36:16,794 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 13:36:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1188 transitions. [2023-12-02 13:36:16,796 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1188 transitions. Word has length 65 [2023-12-02 13:36:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:36:16,796 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1188 transitions. [2023-12-02 13:36:16,796 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 13:36:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1188 transitions. [2023-12-02 13:36:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-02 13:36:16,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:36:16,797 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 13:36:16,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 13:36:17,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-12-02 13:36:17,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:36:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:17,398 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 13:36:17,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:36:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash -435861222, now seen corresponding path program 2 times [2023-12-02 13:36:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:36:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060197149] [2023-12-02 13:36:17,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:36:17,399 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 13:36:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:36:17,400 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:17,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:36:17,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:36:17,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:36:17,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:36:17,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:17,887 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 13:36:17,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:18,042 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 13:36:18,042 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:36:18,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060197149] [2023-12-02 13:36:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060197149] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:18,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1362835370] [2023-12-02 13:36:18,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:36:18,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:36:18,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:36:18,043 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:36:18,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-02 13:36:19,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:36:19,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:36:19,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:36:19,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:36:19,451 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 13:36:19,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:36:19,508 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 13:36:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1362835370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:36:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502853311] [2023-12-02 13:36:19,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:36:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:36:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:36:19,510 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:36:19,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 13:37:01,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:01,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:02,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:37:02,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:02,138 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:37:02,139 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 13:37:02,177 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 13:37:02,455 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:37:02,456 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 13:37:02,537 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 13:37:02,574 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 13:37:02,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:02,696 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:37:02,696 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 13:37:02,708 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 13:37:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502853311] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:37:02,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:37:02,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2023-12-02 13:37:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963698564] [2023-12-02 13:37:02,712 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:37:02,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 13:37:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:37:02,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 13:37:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2023-12-02 13:37:02,714 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 13:37:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:37:15,874 INFO L93 Difference]: Finished difference Result 1393 states and 1741 transitions. [2023-12-02 13:37:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 13:37:15,875 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 13:37:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:37:15,882 INFO L225 Difference]: With dead ends: 1393 [2023-12-02 13:37:15,882 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 13:37:15,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=2206, Unknown=1, NotChecked=100, Total=2756 [2023-12-02 13:37:15,883 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 746 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 7118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 6159 SdHoareTripleChecker+Invalid, 7146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:37:15,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 6159 Invalid, 7146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 7118 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2023-12-02 13:37:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 13:37:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 981. [2023-12-02 13:37:15,897 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 13:37:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1199 transitions. [2023-12-02 13:37:15,899 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1199 transitions. Word has length 68 [2023-12-02 13:37:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:37:15,899 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1199 transitions. [2023-12-02 13:37:15,899 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 13:37:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1199 transitions. [2023-12-02 13:37:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-02 13:37:15,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:37:15,900 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 13:37:15,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 13:37:16,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-12-02 13:37:16,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:37:16,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:37:16,501 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 13:37:16,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:37:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1482008037, now seen corresponding path program 1 times [2023-12-02 13:37:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:37:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665834911] [2023-12-02 13:37:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:37:16,502 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 13:37:16,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:37:16,503 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:37:16,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:37:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:37:16,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 13:37:16,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:16,995 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 13:37:16,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:17,445 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 13:37:17,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:37:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665834911] [2023-12-02 13:37:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665834911] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191357068] [2023-12-02 13:37:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:37:17,446 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:37:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:37:17,447 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:37:17,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 13:37:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:37:17,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 13:37:17,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:18,023 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 13:37:18,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:18,152 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 13:37:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1191357068] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037743629] [2023-12-02 13:37:18,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:37:18,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:37:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:37:18,153 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:37:18,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 13:37:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:37:18,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 13:37:18,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:18,554 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 13:37:18,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:19,245 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 13:37:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037743629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:19,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:37:19,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 13:37:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730642777] [2023-12-02 13:37:19,254 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:37:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 13:37:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:37:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 13:37:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 13:37:19,256 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 13:37:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:37:26,855 INFO L93 Difference]: Finished difference Result 1011 states and 1244 transitions. [2023-12-02 13:37:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 13:37:26,856 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 13:37:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:37:26,861 INFO L225 Difference]: With dead ends: 1011 [2023-12-02 13:37:26,861 INFO L226 Difference]: Without dead ends: 1008 [2023-12-02 13:37:26,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 13:37:26,863 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 26 mSDsluCounter, 10942 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11673 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:37:26,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 11673 Invalid, 2325 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-02 13:37:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-12-02 13:37:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 999. [2023-12-02 13:37:26,879 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 13:37:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1222 transitions. [2023-12-02 13:37:26,881 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1222 transitions. Word has length 74 [2023-12-02 13:37:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:37:26,881 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1222 transitions. [2023-12-02 13:37:26,881 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 13:37:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1222 transitions. [2023-12-02 13:37:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 13:37:26,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:37:26,882 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 13:37:26,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-02 13:37:27,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:37:27,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-12-02 13:37:27,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 13:37:27,483 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 13:37:27,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:37:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1225931803, now seen corresponding path program 2 times [2023-12-02 13:37:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:37:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714293096] [2023-12-02 13:37:27,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:37:27,484 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 13:37:27,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:37:27,485 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:37:27,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:37:27,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:27,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:28,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 13:37:28,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:28,640 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 13:37:28,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:30,865 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 13:37:30,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:37:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714293096] [2023-12-02 13:37:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714293096] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [21490589] [2023-12-02 13:37:30,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:37:30,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:37:30,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:37:30,867 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:37:30,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 13:37:32,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:32,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:32,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 13:37:32,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:32,710 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 13:37:32,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:33,268 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 13:37:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [21490589] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:37:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750140329] [2023-12-02 13:37:33,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:37:33,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:37:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:37:33,269 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:37:33,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 13:37:49,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:37:49,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:37:49,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:37:49,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:37:49,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 13:37:49,484 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:37:49,485 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 13:37:49,490 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 13:37:49,603 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 13:37:49,609 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 13:37:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 13:37:49,957 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 13:37:50,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:37:50,579 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 13:37:50,591 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 13:37:50,774 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 13:37:50,779 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 13:37:50,883 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 13:37:50,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:37:51,912 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 13:37:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750140329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:37:51,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:37:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2023-12-02 13:37:51,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666953828] [2023-12-02 13:37:51,920 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:37:51,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-02 13:37:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:37:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-02 13:37:51,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2023-12-02 13:37:51,923 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 13:38:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:38:37,660 INFO L93 Difference]: Finished difference Result 1467 states and 1856 transitions. [2023-12-02 13:38:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-02 13:38:37,660 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 13:38:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:38:37,667 INFO L225 Difference]: With dead ends: 1467 [2023-12-02 13:38:37,667 INFO L226 Difference]: Without dead ends: 1460 [2023-12-02 13:38:37,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3720 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3451, Invalid=16012, Unknown=1, NotChecked=276, Total=19740 [2023-12-02 13:38:37,675 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 774 mSDsluCounter, 10885 mSDsCounter, 0 mSdLazyCounter, 16441 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s 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, 33.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:38:37,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 11302 Invalid, 16509 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 16441 Invalid, 0 Unknown, 0 Unchecked, 33.3s Time] [2023-12-02 13:38:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2023-12-02 13:38:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1034. [2023-12-02 13:38:37,710 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 13:38:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1265 transitions. [2023-12-02 13:38:37,712 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1265 transitions. Word has length 86 [2023-12-02 13:38:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:38:37,712 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1265 transitions. [2023-12-02 13:38:37,712 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 13:38:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1265 transitions. [2023-12-02 13:38:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 13:38:37,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:38:37,713 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 13:38:37,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:38:37,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 13:38:38,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 13:38:38,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:38:38,314 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 13:38:38,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:38:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash 480841229, now seen corresponding path program 1 times [2023-12-02 13:38:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:38:38,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776758916] [2023-12-02 13:38:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:38,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:38:38,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:38:38,317 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:38:38,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:38:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:39,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 13:38:39,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:39,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 13:38:39,246 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:38:39,247 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 13:38: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 13:38:39,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 13:38:40,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:40,359 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 13:38:40,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:40,480 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 13:38:40,494 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 13:38:40,534 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 13:38:40,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:42,649 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 13:38:43,061 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 13:38:43,067 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:38:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776758916] [2023-12-02 13:38:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776758916] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [782308923] [2023-12-02 13:38:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:43,068 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:38:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:38:43,068 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:38:43,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 13:38:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:45,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:38:45,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:45,508 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 13:38:45,833 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:38:45,833 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 13:38:45,912 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 13:38:46,096 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 13:38:47,085 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:38:47,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:38:47,246 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:38:47,246 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 13:38:47,259 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 13:38:47,269 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 13:38:47,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:48,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3830 (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_3314)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:38:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [782308923] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523828345] [2023-12-02 13:38:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:48,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:38:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:38:48,157 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:38:48,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 13:38:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:48,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 13:38:48,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:48,835 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:38:48,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 13:38:48,880 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 13:38:49,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:49,328 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 13:38:49,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:38:49,430 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 13:38:49,515 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 13:38:49,519 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 13:38:49,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:49,542 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:38:49,542 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 13:38:49,550 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4252) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem40#1.base|)) is different from false [2023-12-02 13:38:49,560 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 13:38:50,002 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 13:38:50,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523828345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:50,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:38:50,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-12-02 13:38:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143588078] [2023-12-02 13:38:50,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:38:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 13:38:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:38:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 13:38:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=494, Unknown=12, NotChecked=306, Total=930 [2023-12-02 13:38:50,008 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 13:39:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:39:00,516 INFO L93 Difference]: Finished difference Result 1440 states and 1797 transitions. [2023-12-02 13:39:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:39:00,517 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 13:39:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:39:00,524 INFO L225 Difference]: With dead ends: 1440 [2023-12-02 13:39:00,524 INFO L226 Difference]: Without dead ends: 1440 [2023-12-02 13:39:00,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 312 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=12, NotChecked=318, Total=992 [2023-12-02 13:39:00,525 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 724 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:39:00,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3922 Invalid, 4529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4512 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-12-02 13:39:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2023-12-02 13:39:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1033. [2023-12-02 13:39:00,540 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 13:39:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1264 transitions. [2023-12-02 13:39:00,541 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1264 transitions. Word has length 110 [2023-12-02 13:39:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:39:00,542 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1264 transitions. [2023-12-02 13:39:00,542 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 13:39:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1264 transitions. [2023-12-02 13:39:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 13:39:00,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:39:00,543 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 13:39:00,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:39:00,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-12-02 13:39:00,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 13:39:01,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:39:01,144 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 13:39:01,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:39:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash 480841230, now seen corresponding path program 1 times [2023-12-02 13:39:01,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:39:01,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102298752] [2023-12-02 13:39:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:39:01,145 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 13:39:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:39:01,146 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:39:01,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:39:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:39:01,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 13:39:01,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:39:01,976 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 13:39:02,293 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 13:39:02,311 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:39:02,311 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 13:39:02,353 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 13:39:02,358 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 13:39:02,479 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 13:39:02,484 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 13:39:03,253 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:39:03,254 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 13:39:03,266 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 13:39:03,379 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:39:03,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 50 treesize of output 45 [2023-12-02 13:39:03,392 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 13:39:03,405 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 13:39:03,419 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 13:39:03,446 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 13:39:03,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:39:03,609 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 13:39:03,652 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 13:39:04,990 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 13:39:04,999 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:39:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102298752] [2023-12-02 13:39:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102298752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:39:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1214538668] [2023-12-02 13:39:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:39:05,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:39:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:39:05,001 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:39:05,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 13:39:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:39:09,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 13:39:09,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:39:09,318 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 13:39:09,324 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 13:39:09,839 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 13:39:09,840 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 13:39:09,879 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:39:09,880 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 13:39:09,947 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 13:39:09,962 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 13:39:10,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 17 treesize of output 9 [2023-12-02 13:39:10,130 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 13:39:10,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:39:10,853 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 13:39:11,137 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 13:39:11,149 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 13:39:11,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:39:11,319 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 13:39:11,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:39:11,335 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 13:39:11,449 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 13:39:11,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:39:11,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 167 [2023-12-02 13:39:17,291 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 13:39:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1214538668] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:39:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315455323] [2023-12-02 13:39:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:39:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:39:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:39:17,522 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:39:17,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 13:39:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:39:18,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 13:39:18,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:39:18,143 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 13:39:18,528 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:39:18,528 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 13:39:18,539 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 13:39:18,706 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 13:39:18,730 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 13:39:19,125 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 13:39:19,132 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 13:39:20,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:39:20,175 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 13:39:20,190 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 13:39:20,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:39:20,596 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 13:39:20,605 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 13:39:20,632 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 13:39:20,643 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 13:39:20,649 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 13:39:20,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:39:20,728 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 13:39:20,777 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 13:39:22,429 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 13:39:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315455323] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:39:22,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:39:22,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2023-12-02 13:39:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743313161] [2023-12-02 13:39:22,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:39:22,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 13:39:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:39:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 13:39:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=718, Unknown=7, NotChecked=420, Total=1260 [2023-12-02 13:39:22,443 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 13:39:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:39:54,791 INFO L93 Difference]: Finished difference Result 1438 states and 1795 transitions. [2023-12-02 13:39:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:39:54,792 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 13:39:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:39:54,797 INFO L225 Difference]: With dead ends: 1438 [2023-12-02 13:39:54,797 INFO L226 Difference]: Without dead ends: 1438 [2023-12-02 13:39:54,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 308 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=210, Invalid=1143, Unknown=7, NotChecked=532, Total=1892 [2023-12-02 13:39:54,798 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 1385 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 8960 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 8982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:39:54,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3647 Invalid, 8982 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 8960 Invalid, 0 Unknown, 0 Unchecked, 31.1s Time] [2023-12-02 13:39:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-12-02 13:39:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1032. [2023-12-02 13:39:54,818 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 13:39:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1263 transitions. [2023-12-02 13:39:54,820 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1263 transitions. Word has length 110 [2023-12-02 13:39:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:39:54,821 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 1263 transitions. [2023-12-02 13:39:54,821 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 13:39:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1263 transitions. [2023-12-02 13:39:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:39:54,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:39:54,822 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 13:39:54,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 13:39:55,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 13:39:55,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Ended with exit code 0 [2023-12-02 13:39:55,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:39:55,423 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 13:39:55,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:39:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1766673317, now seen corresponding path program 1 times [2023-12-02 13:39:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:39:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349545512] [2023-12-02 13:39:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:39:55,424 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 13:39:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:39:55,425 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:39:55,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:39:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:39:56,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 13:39:56,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:39:56,375 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 13:39:56,644 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:39:56,644 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 13:39:56,701 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 13:39:56,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 13:39:58,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:39:58,197 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 13:39:58,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:39:58,381 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 13:39:58,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:39:58,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 13:39:58,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 33 treesize of output 15 [2023-12-02 13:39:58,600 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 13:39:58,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:39:58,700 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6335) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:40:00,808 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 13:40:00,829 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 13:40:01,360 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 13:40:01,366 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:40:01,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349545512] [2023-12-02 13:40:01,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349545512] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:01,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1567058006] [2023-12-02 13:40:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:40:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:40:01,368 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:40:01,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 13:40:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:27,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 13:40:27,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:27,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 7 [2023-12-02 13:40:28,460 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:40:28,461 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 13:40:28,561 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 13:40:28,801 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 13:40:30,092 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:40:30,092 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 13:40:30,360 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:40:30,361 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 13:40:30,537 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:40:30,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 13:40:30,562 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 13:40:30,576 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 13:40:30,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:40:30,599 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 13:40:30,617 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 13:40:30,637 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 13:40:30,658 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 13:40:31,192 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 13:40:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1567058006] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151927665] [2023-12-02 13:40:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:40:31,199 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:40:31,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 13:40:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:31,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 13:40:31,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:31,894 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 13:40:32,110 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:40:32,110 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 13:40:32,177 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 13:40:32,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:40:32,868 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 13:40:33,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:40:33,009 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 13:40:35,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:40:35,242 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 13:40:35,259 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 13:40:35,265 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 13:40:35,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:40:37,453 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 13:40:37,485 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 13:40:37,485 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 13:40:37,499 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 13:40:37,515 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 13:40:38,030 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 13:40:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151927665] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:38,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:40:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2023-12-02 13:40:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44369802] [2023-12-02 13:40:38,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:40:38,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 13:40:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:40:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 13:40:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=673, Unknown=22, NotChecked=858, Total=1722 [2023-12-02 13:40:38,036 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 13:40:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:40:56,149 INFO L93 Difference]: Finished difference Result 1438 states and 1795 transitions. [2023-12-02 13:40:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:40:56,150 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 13:40:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:40:56,154 INFO L225 Difference]: With dead ends: 1438 [2023-12-02 13:40:56,155 INFO L226 Difference]: Without dead ends: 1438 [2023-12-02 13:40:56,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=181, Invalid=719, Unknown=22, NotChecked=884, Total=1806 [2023-12-02 13:40:56,156 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 722 mSDsluCounter, 4634 mSDsCounter, 0 mSdLazyCounter, 5920 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 5043 SdHoareTripleChecker+Invalid, 5946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:40:56,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 5043 Invalid, 5946 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 5920 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2023-12-02 13:40:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-12-02 13:40:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1031. [2023-12-02 13:40:56,170 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 13:40:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1262 transitions. [2023-12-02 13:40:56,172 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1262 transitions. Word has length 112 [2023-12-02 13:40:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:40:56,172 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1262 transitions. [2023-12-02 13:40:56,172 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 13:40:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1262 transitions. [2023-12-02 13:40:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:40:56,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:56,173 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 13:40:56,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:40:56,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-12-02 13:40:56,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 13:40:56,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:56,774 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 13:40:56,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:56,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1766673316, now seen corresponding path program 1 times [2023-12-02 13:40:56,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:40:56,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846648250] [2023-12-02 13:40:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:56,776 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 13:40:56,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:40:56,777 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:40:56,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:40:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:57,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 13:40:57,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:57,801 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 13:40:58,258 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:40:58,258 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 13:40:58,269 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 13:40:58,324 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 13:40:58,334 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 13:40:58,481 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 13:40:58,488 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 13:40:59,564 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:40:59,565 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 13:40:59,572 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 13:40:59,759 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:40:59,760 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 13:40:59,776 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 13:40:59,920 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:40:59,920 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 13:40:59,927 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 13:40:59,964 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 13:40:59,971 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 13:41:00,022 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 13:41:00,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:00,256 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 13:41:00,298 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 13:41:00,361 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 13:41:00,434 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 13:41:02,274 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 13:41:02,293 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:41:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846648250] [2023-12-02 13:41:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846648250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1463021510] [2023-12-02 13:41:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:02,293 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:41:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:41:02,294 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:41:02,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 13:41:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:56,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 13:41:56,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:56,313 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 13:41:56,784 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:41:56,784 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 13:41:56,806 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 13:41:56,827 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 13:41:56,838 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 13:41:56,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 13:41:56,941 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 13:41:57,972 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:41:57,973 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 13:41:57,981 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 13:41:58,125 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:41:58,125 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 13:41:58,141 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 13:41:58,206 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:41:58,206 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 13:41:58,222 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 13:41:58,248 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 13:41:58,255 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 13:41:58,262 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 13:41:58,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:58,333 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 13:41:58,374 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 13:41:58,432 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 13:41:58,493 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 13:42:01,761 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 13:42:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1463021510] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360418590] [2023-12-02 13:42:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:01,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:01,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:01,781 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:42:01,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 13:42:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:02,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 13:42:02,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:02,601 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 13:42:02,888 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 13:42:02,915 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:42:02,915 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 13:42:03,018 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 13:42:03,055 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 13:42:03,326 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 13:42:03,333 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 13:42:04,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:04,500 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 13:42:04,523 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 13:42:04,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:04,816 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 13:42:04,826 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 13:42:05,028 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:05,028 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 13:42:05,047 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 13:42:05,084 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 13:42:05,104 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 13:42:05,107 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 13:42:05,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:05,210 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 13:42:05,266 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 13:42:05,335 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 13:42:05,400 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 13:42:08,099 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 13:42:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360418590] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:08,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:42:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 13:42:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493651358] [2023-12-02 13:42:08,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:42:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 13:42:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:42:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 13:42:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 13:42:08,111 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 13:42:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:25,122 INFO L93 Difference]: Finished difference Result 1436 states and 1793 transitions. [2023-12-02 13:42:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:42:25,123 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 13:42:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:25,128 INFO L225 Difference]: With dead ends: 1436 [2023-12-02 13:42:25,128 INFO L226 Difference]: Without dead ends: 1436 [2023-12-02 13:42:25,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 13:42:25,129 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 1367 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 4326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:25,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2032 Invalid, 4326 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2023-12-02 13:42:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2023-12-02 13:42:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1030. [2023-12-02 13:42:25,150 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 13:42:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1261 transitions. [2023-12-02 13:42:25,153 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1261 transitions. Word has length 112 [2023-12-02 13:42:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:25,154 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1261 transitions. [2023-12-02 13:42:25,154 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 13:42:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1261 transitions. [2023-12-02 13:42:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 13:42:25,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:25,156 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 13:42:25,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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)] Forceful destruction successful, exit code 0 [2023-12-02 13:42:25,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 13:42:25,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 13:42:25,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:25,776 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 13:42:25,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1259607676, now seen corresponding path program 1 times [2023-12-02 13:42:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:42:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140236971] [2023-12-02 13:42:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:25,777 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 13:42:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:42:25,779 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:42:25,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/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 13:42:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:27,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 13:42:27,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:27,331 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 13:42:27,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 5 [2023-12-02 13:42:27,629 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:42:27,629 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 13:42:27,679 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 13:42:27,707 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 13:42:27,895 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 13:42:27,903 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 13:42:29,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:29,173 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 13:42:29,189 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 13:42:29,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:29,391 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 13:42:29,401 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 13:42:29,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:29,577 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 13:42:29,598 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 13:42:29,753 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:42:29,753 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 13:42:29,774 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 13:42:29,791 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 13:42:29,802 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 13:42:29,860 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 13:42:29,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:30,087 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 13:42:30,127 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 13:42:30,224 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 13:42:30,318 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_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| .cse0 v_ArrVal_9591))) (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_9590) .cse1 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (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 ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9590) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 13:42:31,121 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (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))) (v_ArrVal_9589 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9588 (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_9589))) (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_9588) .cse1 v_ArrVal_9590) (select (select (store .cse2 .cse1 v_ArrVal_9591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9592))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (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 ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9589))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9591))) (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_9588) .cse4 v_ArrVal_9590) .cse5 v_ArrVal_9592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:42:41,981 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 13:42:42,009 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:42:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140236971] [2023-12-02 13:42:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140236971] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1419892261] [2023-12-02 13:42:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:42,009 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:42:42,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:42:42,010 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:42:42,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 13:48:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:48:24,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 13:48:24,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:48:24,662 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 13:48:26,487 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 13:48:26,578 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:48:26,578 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 13:48:26,897 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 13:48:26,932 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 13:48:27,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 13:48:27,831 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 13:48:31,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:48:31,119 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 13:48:31,170 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 13:48:31,989 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:48:31,989 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 13:48:32,009 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 13:48:32,560 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:48:32,561 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 13:48:32,596 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 13:48:33,150 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:48:33,150 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 13:48:33,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 13:48:33,271 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 13:48:33,305 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 13:48:33,307 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 13:48:33,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:48:33,463 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 13:48:33,563 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 13:48:33,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (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_10188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10186))) (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~mem41#1.base| v_ArrVal_10187) .cse0 v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (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 ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10187) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 13:48:34,062 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 13:48:36,205 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 13:48:37,361 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 13:48:42,530 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 13:48:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1419892261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:48:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763185452] [2023-12-02 13:48:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:48:42,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:48:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:48:42,566 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:48:42,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bdc3189-d575-4a86-80db-04f239ca4944/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 13:48:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:48:43,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 13:48:43,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:48:43,363 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 13:48:44,254 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:48:44,254 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 13:48:44,289 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 13:48:44,354 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 13:48:44,430 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 13:48:44,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 22 treesize of output 10 [2023-12-02 13:48:44,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 13:48:48,122 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:48:48,123 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 13:48:48,143 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 13:48:48,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:48:48,503 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 13:48:48,560 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 13:48:48,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:48:48,775 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 13:48:48,814 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 13:48:49,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:48:49,042 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 13:48:49,098 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 13:48:49,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 13:48:49,179 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 13:48:49,199 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 13:48:49,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:48:49,379 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 13:48:49,472 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 13:48:49,572 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 13:48:49,683 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 13:48:51,801 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (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)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10781))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10782))) (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~mem40#1.base| v_ArrVal_10780) .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_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 ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10781))) (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~mem40#1.base| v_ArrVal_10780) .cse6 v_ArrVal_10783) (select (select (store .cse7 .cse6 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 (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-12-02 13:48:53,176 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 13:48:58,336 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 13:48:58,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763185452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:48:58,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:48:58,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2023-12-02 13:48:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748717001] [2023-12-02 13:48:58,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:48:58,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 13:48:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:48:58,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 13:48:58,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=394, Unknown=26, NotChecked=1180, Total=1722 [2023-12-02 13:48:58,368 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)