./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:19:29,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:19:29,350 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 14:19:29,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:19:29,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:19:29,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:19:29,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:19:29,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:19:29,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:19:29,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:19:29,383 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:19:29,383 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:19:29,384 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:19:29,384 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:19:29,385 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:19:29,385 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:19:29,386 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:19:29,386 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:19:29,387 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:19:29,387 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:19:29,388 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:19:29,388 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:19:29,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:19:29,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:19:29,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:19:29,390 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:19:29,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:19:29,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:19:29,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:19:29,392 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:19:29,392 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:19:29,393 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:19:29,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:19:29,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:19:29,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:19:29,394 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:19:29,394 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:19:29,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:19:29,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:19:29,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:19:29,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:19:29,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:19:29,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:19:29,396 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:19:29,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:19:29,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:19:29,396 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:19:29,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:19:29,397 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_ec8dd26f-95d2-4ed8-8b0c-571746923719/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_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 -> 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c [2023-12-02 14:19:29,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:19:29,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:19:29,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:19:29,629 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:19:29,629 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:19:29,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2023-12-02 14:19:32,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:19:32,664 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:19:32,665 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2023-12-02 14:19:32,684 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data/f446ee116/835bec8c7fa04f4b8489322417713ba6/FLAG0091a5eae [2023-12-02 14:19:32,696 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data/f446ee116/835bec8c7fa04f4b8489322417713ba6 [2023-12-02 14:19:32,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:19:32,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:19:32,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:19:32,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:19:32,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:19:32,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:19:32" (1/1) ... [2023-12-02 14:19:32,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4c3ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:32, skipping insertion in model container [2023-12-02 14:19:32,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:19:32" (1/1) ... [2023-12-02 14:19:32,765 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:19:33,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:19:33,198 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 14:19:33,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f0e4a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:33, skipping insertion in model container [2023-12-02 14:19:33,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:19:33,199 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 14:19:33,202 INFO L158 Benchmark]: Toolchain (without parser) took 501.39ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 107.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 14:19:33,202 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:19:33,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.05ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 107.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 14:19:33,204 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.17ms. Allocated memory is still 102.8MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.05ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 107.1MB in the end (delta: 19.5MB). 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:19:34,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:19:35,010 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 14:19:35,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:19:35,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:19:35,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:19:35,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:19:35,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:19:35,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:19:35,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:19:35,049 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:19:35,050 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:19:35,050 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:19:35,051 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:19:35,051 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:19:35,052 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:19:35,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:19:35,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:19:35,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:19:35,055 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:19:35,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:19:35,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:19:35,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:19:35,057 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:19:35,057 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:19:35,058 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:19:35,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:19:35,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:19:35,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 14:19:35,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 14:19:35,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:19:35,060 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:19:35,060 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:19:35,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:19:35,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 14:19:35,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:19:35,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:19:35,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:19:35,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:19:35,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:19:35,062 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 14:19:35,063 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 14:19:35,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:19:35,063 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:19:35,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:19:35,064 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_ec8dd26f-95d2-4ed8-8b0c-571746923719/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_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 -> 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c [2023-12-02 14:19:35,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:19:35,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:19:35,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:19:35,377 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:19:35,378 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:19:35,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2023-12-02 14:19:38,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:19:38,424 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:19:38,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2023-12-02 14:19:38,443 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data/618c25d81/f4d0427be46746c59a6afe922529404a/FLAG3dcef385c [2023-12-02 14:19:38,458 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/data/618c25d81/f4d0427be46746c59a6afe922529404a [2023-12-02 14:19:38,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:19:38,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:19:38,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:19:38,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:19:38,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:19:38,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:19:38" (1/1) ... [2023-12-02 14:19:38,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10378837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:38, skipping insertion in model container [2023-12-02 14:19:38,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:19:38" (1/1) ... [2023-12-02 14:19:38,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:19:39,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:19:39,056 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 14:19:39,075 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:19:39,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:19:39,157 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:19:39,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:19:39,294 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:19:39,302 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:19:39,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39 WrapperNode [2023-12-02 14:19:39,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:19:39,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:19:39,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:19:39,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:19:39,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,388 INFO L138 Inliner]: procedures = 180, calls = 287, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1047 [2023-12-02 14:19:39,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:19:39,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:19:39,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:19:39,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:19:39,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:19:39,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:19:39,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:19:39,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:19:39,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (1/1) ... [2023-12-02 14:19:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:19:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:19:39,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:19:39,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:19:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 14:19:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 14:19:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 14:19:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 14:19:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 14:19:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 14:19:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 14:19:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:19:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 14:19:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 14:19:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:19:39,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:19:39,763 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:19:39,766 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:19:39,793 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 14:19:44,046 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:19:44,178 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:19:44,178 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 14:19:44,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:19:44 BoogieIcfgContainer [2023-12-02 14:19:44,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:19:44,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:19:44,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:19:44,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:19:44,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:19:38" (1/3) ... [2023-12-02 14:19:44,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a25e3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:19:44, skipping insertion in model container [2023-12-02 14:19:44,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:39" (2/3) ... [2023-12-02 14:19:44,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a25e3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:19:44, skipping insertion in model container [2023-12-02 14:19:44,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:19:44" (3/3) ... [2023-12-02 14:19:44,187 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-1.i [2023-12-02 14:19:44,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:19:44,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 533 error locations. [2023-12-02 14:19:44,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:19:44,260 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;@f445c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:19:44,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 533 error locations. [2023-12-02 14:19:44,267 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 14:19:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:19:44,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:44,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:19:44,273 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 14:19:44,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash 54582, now seen corresponding path program 1 times [2023-12-02 14:19:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943965261] [2023-12-02 14:19:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:44,288 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 14:19:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:44,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:44,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:44,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:19:44,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:44,517 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 14:19:44,528 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 14:19:44,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:44,528 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943965261] [2023-12-02 14:19:44,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943965261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:44,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:44,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:19:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829645262] [2023-12-02 14:19:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:19:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:44,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:19:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:19:44,560 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 14:19:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:46,306 INFO L93 Difference]: Finished difference Result 974 states and 1039 transitions. [2023-12-02 14:19:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:19:46,308 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 14:19:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:46,324 INFO L225 Difference]: With dead ends: 974 [2023-12-02 14:19:46,324 INFO L226 Difference]: Without dead ends: 973 [2023-12-02 14:19:46,326 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 14:19:46,329 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 901 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:46,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 594 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 14:19:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2023-12-02 14:19:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 964. [2023-12-02 14:19:46,399 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 14:19:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1030 transitions. [2023-12-02 14:19:46,405 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1030 transitions. Word has length 2 [2023-12-02 14:19:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:46,406 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1030 transitions. [2023-12-02 14:19:46,406 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 14:19:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1030 transitions. [2023-12-02 14:19:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:19:46,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:46,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:19:46,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:46,608 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 14:19:46,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 54583, now seen corresponding path program 1 times [2023-12-02 14:19:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:46,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384319361] [2023-12-02 14:19:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:46,610 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 14:19:46,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:46,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:46,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:46,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:19:46,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:46,724 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 14:19:46,735 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 14:19:46,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:46,735 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384319361] [2023-12-02 14:19:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384319361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:19:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869151439] [2023-12-02 14:19:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:19:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:19:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:19:46,738 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 14:19:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:49,868 INFO L93 Difference]: Finished difference Result 1339 states and 1446 transitions. [2023-12-02 14:19:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:19:49,869 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 14:19:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:49,875 INFO L225 Difference]: With dead ends: 1339 [2023-12-02 14:19:49,875 INFO L226 Difference]: Without dead ends: 1339 [2023-12-02 14:19:49,876 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 14:19:49,877 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 14:19:49,877 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 14:19:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2023-12-02 14:19:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1133. [2023-12-02 14:19:49,901 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 14:19:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1411 transitions. [2023-12-02 14:19:49,906 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1411 transitions. Word has length 2 [2023-12-02 14:19:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:49,906 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1411 transitions. [2023-12-02 14:19:49,906 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 14:19:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1411 transitions. [2023-12-02 14:19:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 14:19:49,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:49,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 14:19:49,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:50,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:50,108 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 14:19:50,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1132069568, now seen corresponding path program 1 times [2023-12-02 14:19:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047931268] [2023-12-02 14:19:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:50,110 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 14:19:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:50,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:50,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:50,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:19:50,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:50,258 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 14:19:50,265 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 14:19:50,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:19:50,331 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 14:19:50,350 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:19:50,351 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 14:19:50,370 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 14:19:50,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:50,370 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047931268] [2023-12-02 14:19:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047931268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:19:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116805991] [2023-12-02 14:19:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:50,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:19:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:19:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:19:50,373 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 14:19:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:53,065 INFO L93 Difference]: Finished difference Result 1136 states and 1416 transitions. [2023-12-02 14:19:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:19:53,065 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 14:19:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:53,072 INFO L225 Difference]: With dead ends: 1136 [2023-12-02 14:19:53,072 INFO L226 Difference]: Without dead ends: 1136 [2023-12-02 14:19:53,072 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 14:19:53,073 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 986 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:53,074 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.6s Time] [2023-12-02 14:19:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-02 14:19:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 953. [2023-12-02 14:19:53,096 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 14:19:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1018 transitions. [2023-12-02 14:19:53,101 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1018 transitions. Word has length 6 [2023-12-02 14:19:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:53,101 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1018 transitions. [2023-12-02 14:19:53,101 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 14:19:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1018 transitions. [2023-12-02 14:19:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:19:53,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:53,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:19:53,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:53,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:53,308 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 14:19:53,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash -734418257, now seen corresponding path program 1 times [2023-12-02 14:19:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040286693] [2023-12-02 14:19:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:53,310 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 14:19:53,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:53,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:53,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:53,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:19:53,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:53,436 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 14:19:53,449 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 14:19:53,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:53,449 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:53,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040286693] [2023-12-02 14:19:53,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040286693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:53,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:53,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:19:53,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666907489] [2023-12-02 14:19:53,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:19:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:19:53,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:19:53,451 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 14:19:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:55,498 INFO L93 Difference]: Finished difference Result 1247 states and 1342 transitions. [2023-12-02 14:19:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:19:55,499 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 14:19:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:55,506 INFO L225 Difference]: With dead ends: 1247 [2023-12-02 14:19:55,506 INFO L226 Difference]: Without dead ends: 1247 [2023-12-02 14:19:55,506 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 14:19:55,507 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 895 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:55,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1003 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 14:19:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-12-02 14:19:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 904. [2023-12-02 14:19:55,531 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 14:19:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 969 transitions. [2023-12-02 14:19:55,536 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 969 transitions. Word has length 7 [2023-12-02 14:19:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:55,536 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 969 transitions. [2023-12-02 14:19:55,536 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 14:19:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 969 transitions. [2023-12-02 14:19:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:19:55,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:55,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:19:55,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:55,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:55,738 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 14:19:55,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash -734418256, now seen corresponding path program 1 times [2023-12-02 14:19:55,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326037591] [2023-12-02 14:19:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:55,740 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 14:19:55,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:55,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:55,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:55,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:19:55,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:55,869 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 14:19:55,894 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 14:19:55,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:55,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:55,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326037591] [2023-12-02 14:19:55,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326037591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:55,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:19:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789511860] [2023-12-02 14:19:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:55,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:19:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:19:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:19:55,897 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 14:19:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:58,918 INFO L93 Difference]: Finished difference Result 1317 states and 1415 transitions. [2023-12-02 14:19:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:19:58,920 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 14:19:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:58,926 INFO L225 Difference]: With dead ends: 1317 [2023-12-02 14:19:58,926 INFO L226 Difference]: Without dead ends: 1317 [2023-12-02 14:19:58,926 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 14:19:58,927 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 613 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:58,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1326 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 14:19:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-12-02 14:19:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 917. [2023-12-02 14:19:58,943 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 14:19:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1016 transitions. [2023-12-02 14:19:58,945 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1016 transitions. Word has length 7 [2023-12-02 14:19:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:58,946 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1016 transitions. [2023-12-02 14:19:58,946 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 14:19:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1016 transitions. [2023-12-02 14:19:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 14:19:58,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:58,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:19:58,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:59,148 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 14:19:59,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1228521271, now seen corresponding path program 1 times [2023-12-02 14:19:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069539501] [2023-12-02 14:19:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:59,149 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 14:19:59,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:59,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:59,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:19:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:59,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:19:59,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:59,319 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 14:19:59,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:59,320 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069539501] [2023-12-02 14:19:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069539501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:59,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:19:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25476371] [2023-12-02 14:19:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:19:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:19:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:19:59,321 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 14:20:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:01,057 INFO L93 Difference]: Finished difference Result 1325 states and 1458 transitions. [2023-12-02 14:20:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:20:01,059 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 14:20:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:01,065 INFO L225 Difference]: With dead ends: 1325 [2023-12-02 14:20:01,065 INFO L226 Difference]: Without dead ends: 1325 [2023-12-02 14:20:01,065 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 14:20:01,065 INFO L413 NwaCegarLoop]: 894 mSDtfsCounter, 497 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:01,066 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.7s Time] [2023-12-02 14:20:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2023-12-02 14:20:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1117. [2023-12-02 14:20:01,082 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 14:20:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1431 transitions. [2023-12-02 14:20:01,085 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1431 transitions. Word has length 10 [2023-12-02 14:20:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:01,085 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1431 transitions. [2023-12-02 14:20:01,086 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 14:20:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1431 transitions. [2023-12-02 14:20:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:20:01,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:01,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:20:01,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:01,287 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 14:20:01,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash 570547524, now seen corresponding path program 1 times [2023-12-02 14:20:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172233608] [2023-12-02 14:20:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:01,288 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 14:20:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:01,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:01,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:01,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:20:01,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:01,441 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:20:01,441 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:20:01,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:20:01,446 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 14:20:01,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:01,508 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 14:20:01,522 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 14:20:01,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:01,523 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172233608] [2023-12-02 14:20:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172233608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:01,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:20:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762804880] [2023-12-02 14:20:01,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:01,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:01,525 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 14:20:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:03,536 INFO L93 Difference]: Finished difference Result 1464 states and 1849 transitions. [2023-12-02 14:20:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:03,537 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 14:20:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:03,542 INFO L225 Difference]: With dead ends: 1464 [2023-12-02 14:20:03,542 INFO L226 Difference]: Without dead ends: 1464 [2023-12-02 14:20:03,543 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 14:20:03,543 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 348 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:03,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2426 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 14:20:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2023-12-02 14:20:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1116. [2023-12-02 14:20:03,563 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 14:20:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1429 transitions. [2023-12-02 14:20:03,566 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1429 transitions. Word has length 11 [2023-12-02 14:20:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:03,566 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1429 transitions. [2023-12-02 14:20:03,567 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 14:20:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1429 transitions. [2023-12-02 14:20:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 14:20:03,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:03,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:20:03,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 14:20:03,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:03,769 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 14:20:03,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:03,769 INFO L85 PathProgramCache]: Analyzing trace with hash 661679463, now seen corresponding path program 1 times [2023-12-02 14:20:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80622311] [2023-12-02 14:20:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:03,770 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 14:20:03,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:03,771 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:03,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:03,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:20:03,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:03,937 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 14:20:03,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:03,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:03,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80622311] [2023-12-02 14:20:03,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80622311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:20:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630728795] [2023-12-02 14:20:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:03,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:20:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:20:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:20:03,939 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 14:20:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:04,636 INFO L93 Difference]: Finished difference Result 1062 states and 1349 transitions. [2023-12-02 14:20:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:20:04,638 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 14:20:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:04,642 INFO L225 Difference]: With dead ends: 1062 [2023-12-02 14:20:04,642 INFO L226 Difference]: Without dead ends: 1062 [2023-12-02 14:20:04,642 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 14:20:04,643 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 70 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:04,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1545 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 14:20:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2023-12-02 14:20:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2023-12-02 14:20:04,670 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 14:20:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1349 transitions. [2023-12-02 14:20:04,675 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1349 transitions. Word has length 15 [2023-12-02 14:20:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:04,675 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1349 transitions. [2023-12-02 14:20:04,675 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 14:20:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1349 transitions. [2023-12-02 14:20:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 14:20:04,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:04,676 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 14:20:04,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:04,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:04,877 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 14:20:04,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash 218799840, now seen corresponding path program 1 times [2023-12-02 14:20:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:04,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785826320] [2023-12-02 14:20:04,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:04,878 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 14:20:04,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:04,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:04,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:05,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:20:05,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:05,030 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 14:20:05,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:05,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785826320] [2023-12-02 14:20:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785826320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:05,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:20:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882328995] [2023-12-02 14:20:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:05,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:05,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:05,031 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 14:20:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:05,988 INFO L93 Difference]: Finished difference Result 1048 states and 1307 transitions. [2023-12-02 14:20:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:05,990 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 14:20:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:05,993 INFO L225 Difference]: With dead ends: 1048 [2023-12-02 14:20:05,993 INFO L226 Difference]: Without dead ends: 1048 [2023-12-02 14:20:05,994 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 14:20:05,994 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 14:20:05,995 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 14:20:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-12-02 14:20:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2023-12-02 14:20:06,009 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 14:20:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1305 transitions. [2023-12-02 14:20:06,012 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1305 transitions. Word has length 17 [2023-12-02 14:20:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:06,012 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1305 transitions. [2023-12-02 14:20:06,013 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 14:20:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1305 transitions. [2023-12-02 14:20:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 14:20:06,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:06,014 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 14:20:06,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:06,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:06,215 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 14:20:06,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash -195365074, now seen corresponding path program 1 times [2023-12-02 14:20:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180565086] [2023-12-02 14:20:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:06,216 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 14:20:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:06,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:06,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:06,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:20:06,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:06,391 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 14:20:06,461 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 14:20:06,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:06,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:06,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180565086] [2023-12-02 14:20:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180565086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:06,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:06,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:20:06,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328406057] [2023-12-02 14:20:06,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:06,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:06,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:06,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:06,464 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 14:20:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:08,877 INFO L93 Difference]: Finished difference Result 1448 states and 1829 transitions. [2023-12-02 14:20:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:08,877 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 14:20:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:08,883 INFO L225 Difference]: With dead ends: 1448 [2023-12-02 14:20:08,883 INFO L226 Difference]: Without dead ends: 1448 [2023-12-02 14:20:08,883 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 14:20:08,884 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 14:20:08,884 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 14:20:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2023-12-02 14:20:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1042. [2023-12-02 14:20:08,900 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 14:20:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1297 transitions. [2023-12-02 14:20:08,903 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1297 transitions. Word has length 31 [2023-12-02 14:20:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:08,903 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1297 transitions. [2023-12-02 14:20:08,903 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 14:20:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1297 transitions. [2023-12-02 14:20:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 14:20:08,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:08,904 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 14:20:08,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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)] Ended with exit code 0 [2023-12-02 14:20:09,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:09,105 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 14:20:09,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -195365073, now seen corresponding path program 1 times [2023-12-02 14:20:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605462150] [2023-12-02 14:20:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:09,106 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 14:20:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:09,107 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:09,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:09,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:20:09,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:09,277 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 14:20:09,459 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 14:20:09,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:09,460 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605462150] [2023-12-02 14:20:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605462150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:20:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159206060] [2023-12-02 14:20:09,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:09,462 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 14:20:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:13,351 INFO L93 Difference]: Finished difference Result 1566 states and 1972 transitions. [2023-12-02 14:20:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:13,353 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 14:20:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:13,360 INFO L225 Difference]: With dead ends: 1566 [2023-12-02 14:20:13,360 INFO L226 Difference]: Without dead ends: 1566 [2023-12-02 14:20:13,360 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 14:20:13,361 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 548 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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 14:20:13,361 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 14:20:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2023-12-02 14:20:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1038. [2023-12-02 14:20:13,375 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 14:20:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1289 transitions. [2023-12-02 14:20:13,378 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1289 transitions. Word has length 31 [2023-12-02 14:20:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:13,378 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1289 transitions. [2023-12-02 14:20:13,379 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 14:20:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1289 transitions. [2023-12-02 14:20:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 14:20:13,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:13,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:20:13,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:13,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:13,583 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 14:20:13,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1055920008, now seen corresponding path program 1 times [2023-12-02 14:20:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422079809] [2023-12-02 14:20:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:13,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:20:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:13,586 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:13,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:13,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:20:13,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:13,844 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 14:20:13,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:13,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422079809] [2023-12-02 14:20:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422079809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:20:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818658769] [2023-12-02 14:20:13,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:13,846 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 14:20:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:14,805 INFO L93 Difference]: Finished difference Result 1026 states and 1269 transitions. [2023-12-02 14:20:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:14,806 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 14:20:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:14,812 INFO L225 Difference]: With dead ends: 1026 [2023-12-02 14:20:14,812 INFO L226 Difference]: Without dead ends: 1026 [2023-12-02 14:20:14,812 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 14:20:14,813 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 14:20:14,813 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 14:20:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-12-02 14:20:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2023-12-02 14:20:14,829 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 14:20:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1269 transitions. [2023-12-02 14:20:14,832 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1269 transitions. Word has length 50 [2023-12-02 14:20:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:14,833 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1269 transitions. [2023-12-02 14:20:14,833 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 14:20:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1269 transitions. [2023-12-02 14:20:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 14:20:14,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:14,835 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 14:20:14,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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)] Forceful destruction successful, exit code 0 [2023-12-02 14:20:15,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:15,039 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 14:20:15,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash 566526599, now seen corresponding path program 1 times [2023-12-02 14:20:15,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:15,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515894559] [2023-12-02 14:20:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:15,040 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 14:20:15,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:15,068 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:15,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:15,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:20:15,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:15,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 14:20:15,366 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 14:20:15,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:20:15,839 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 14:20:15,853 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:20:15,853 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 14:20:15,863 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 14:20:15,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:15,864 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515894559] [2023-12-02 14:20:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515894559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:15,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:15,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:20:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553512463] [2023-12-02 14:20:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:15,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:15,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:15,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:15,866 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 14:20:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:18,774 INFO L93 Difference]: Finished difference Result 1394 states and 1763 transitions. [2023-12-02 14:20:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:18,775 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 14:20:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:18,780 INFO L225 Difference]: With dead ends: 1394 [2023-12-02 14:20:18,780 INFO L226 Difference]: Without dead ends: 1394 [2023-12-02 14:20:18,780 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 14:20:18,781 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1806 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:18,781 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.9s Time] [2023-12-02 14:20:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2023-12-02 14:20:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 965. [2023-12-02 14:20:18,792 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 14:20:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1174 transitions. [2023-12-02 14:20:18,795 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1174 transitions. Word has length 54 [2023-12-02 14:20:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:18,795 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1174 transitions. [2023-12-02 14:20:18,795 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 14:20:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1174 transitions. [2023-12-02 14:20:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 14:20:18,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:18,796 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 14:20:18,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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)] Forceful destruction successful, exit code 0 [2023-12-02 14:20:18,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:18,997 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 14:20:18,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 521436340, now seen corresponding path program 1 times [2023-12-02 14:20:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:18,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934744312] [2023-12-02 14:20:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:18,998 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 14:20:18,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:18,999 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:19,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:19,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:20:19,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:19,240 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 14:20:19,252 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 14:20:19,275 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 14:20:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:20:19,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:19,285 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934744312] [2023-12-02 14:20:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934744312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:20:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388936591] [2023-12-02 14:20:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:19,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:20:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:20:19,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:20:19,286 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 14:20:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:21,776 INFO L93 Difference]: Finished difference Result 964 states and 1173 transitions. [2023-12-02 14:20:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:20:21,777 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 14:20:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:21,781 INFO L225 Difference]: With dead ends: 964 [2023-12-02 14:20:21,781 INFO L226 Difference]: Without dead ends: 964 [2023-12-02 14:20:21,782 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 14:20:21,782 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 3 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:21,782 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.5s Time] [2023-12-02 14:20:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-02 14:20:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2023-12-02 14:20:21,792 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 14:20:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1173 transitions. [2023-12-02 14:20:21,794 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1173 transitions. Word has length 58 [2023-12-02 14:20:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:21,794 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1173 transitions. [2023-12-02 14:20:21,795 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 14:20:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1173 transitions. [2023-12-02 14:20:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 14:20:21,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:21,796 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 14:20:21,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:21,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:21,996 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 14:20:21,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash 521436341, now seen corresponding path program 1 times [2023-12-02 14:20:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137207616] [2023-12-02 14:20:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:21,997 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 14:20:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:21,998 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:21,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:22,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 14:20:22,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:22,255 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 14:20:22,274 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 14:20:22,281 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 14:20:22,316 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 14:20:22,333 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 14:20:22,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:22,333 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137207616] [2023-12-02 14:20:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137207616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:22,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:20:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964324254] [2023-12-02 14:20:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:22,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:20:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:20:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:20:22,335 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 14:20:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:25,581 INFO L93 Difference]: Finished difference Result 963 states and 1172 transitions. [2023-12-02 14:20:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:20:25,582 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 14:20:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:25,586 INFO L225 Difference]: With dead ends: 963 [2023-12-02 14:20:25,586 INFO L226 Difference]: Without dead ends: 963 [2023-12-02 14:20:25,586 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 14:20:25,587 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 1 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:25,587 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.2s Time] [2023-12-02 14:20:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-12-02 14:20:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2023-12-02 14:20:25,598 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 14:20:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1172 transitions. [2023-12-02 14:20:25,600 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1172 transitions. Word has length 58 [2023-12-02 14:20:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:25,600 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1172 transitions. [2023-12-02 14:20:25,600 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 14:20:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1172 transitions. [2023-12-02 14:20:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 14:20:25,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:25,601 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 14:20:25,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:25,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:25,802 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 14:20:25,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash 411489050, now seen corresponding path program 1 times [2023-12-02 14:20:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264459837] [2023-12-02 14:20:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:25,803 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 14:20:25,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:25,804 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:25,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:26,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:20:26,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:26,068 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 14:20:26,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:26,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264459837] [2023-12-02 14:20:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264459837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:26,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:20:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017546721] [2023-12-02 14:20:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:26,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:20:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:20:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:20:26,070 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 14:20:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:27,051 INFO L93 Difference]: Finished difference Result 965 states and 1175 transitions. [2023-12-02 14:20:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:20:27,053 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 14:20:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:27,057 INFO L225 Difference]: With dead ends: 965 [2023-12-02 14:20:27,057 INFO L226 Difference]: Without dead ends: 965 [2023-12-02 14:20:27,058 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 14:20:27,058 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, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:27,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2199 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 14:20:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-12-02 14:20:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2023-12-02 14:20:27,078 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 14:20:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1175 transitions. [2023-12-02 14:20:27,080 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1175 transitions. Word has length 64 [2023-12-02 14:20:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:27,080 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1175 transitions. [2023-12-02 14:20:27,080 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 14:20:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1175 transitions. [2023-12-02 14:20:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 14:20:27,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:27,081 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 14:20:27,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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)] Ended with exit code 0 [2023-12-02 14:20:27,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:27,281 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 14:20:27,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1894795278, now seen corresponding path program 1 times [2023-12-02 14:20:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913289109] [2023-12-02 14:20:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:27,283 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 14:20:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:27,284 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:27,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:27,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:20:27,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:27,577 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 14:20:27,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:27,641 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 14:20:27,642 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913289109] [2023-12-02 14:20:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913289109] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [541499253] [2023-12-02 14:20:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:27,642 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:20:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:20:27,643 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:20:27,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-02 14:20:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:28,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:20:28,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:28,071 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 14:20:28,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:28,099 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 14:20:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [541499253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138450589] [2023-12-02 14:20:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:20:28,101 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:20:28,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 14:20:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:28,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:20:28,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:28,357 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 14:20:28,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:28,380 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 14:20:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138450589] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:28,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:20:28,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 14:20:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399097702] [2023-12-02 14:20:28,381 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:20:28,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:20:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:20:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:20:28,383 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 14:20:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:30,550 INFO L93 Difference]: Finished difference Result 974 states and 1189 transitions. [2023-12-02 14:20:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 14:20:30,551 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 14:20:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:30,555 INFO L225 Difference]: With dead ends: 974 [2023-12-02 14:20:30,555 INFO L226 Difference]: Without dead ends: 974 [2023-12-02 14:20:30,556 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 14:20:30,556 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 6 mSDsluCounter, 4386 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:30,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5119 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 14:20:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-02 14:20:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 973. [2023-12-02 14:20:30,568 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 14:20:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1188 transitions. [2023-12-02 14:20:30,569 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1188 transitions. Word has length 65 [2023-12-02 14:20:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:30,570 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1188 transitions. [2023-12-02 14:20:30,570 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 14:20:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1188 transitions. [2023-12-02 14:20:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-02 14:20:30,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:30,570 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 14:20:30,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-12-02 14:20:30,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 14:20:30,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:31,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:31,171 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 14:20:31,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash -435861222, now seen corresponding path program 2 times [2023-12-02 14:20:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026141957] [2023-12-02 14:20:31,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:20:31,173 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 14:20:31,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:31,174 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:31,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:20:31,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:20:31,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:20:31,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:20:31,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:31,642 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 14:20:31,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:31,772 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 14:20:31,772 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:31,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026141957] [2023-12-02 14:20:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026141957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:31,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [564885286] [2023-12-02 14:20:31,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:20:31,773 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:20:31,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:20:31,774 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:20:31,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-02 14:20:33,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:20:33,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:20:33,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:20:33,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:33,297 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 14:20:33,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:33,355 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 14:20:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [564885286] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616970674] [2023-12-02 14:20:33,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:20:33,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:33,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:20:33,357 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:20:33,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 14:21:18,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:21:18,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:21:18,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 14:21:18,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:18,555 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:21:18,555 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 14:21:18,589 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 14:21:18,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:21:18,857 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 14:21:18,931 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 14:21:18,964 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 14:21:18,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:19,081 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:21:19,081 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 14:21:19,091 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 14:21:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616970674] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:21:19,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 14:21:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2023-12-02 14:21:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045669116] [2023-12-02 14:21:19,095 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 14:21:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 14:21:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:21:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 14:21:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2023-12-02 14:21:19,097 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 14:21:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:21:30,579 INFO L93 Difference]: Finished difference Result 1393 states and 1741 transitions. [2023-12-02 14:21:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 14:21:30,580 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 14:21:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:21:30,586 INFO L225 Difference]: With dead ends: 1393 [2023-12-02 14:21:30,586 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 14:21:30,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=449, Invalid=2206, Unknown=1, NotChecked=100, Total=2756 [2023-12-02 14:21:30,587 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 746 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 7118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s 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, 10.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:21:30,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 6159 Invalid, 7146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 7118 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-12-02 14:21:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 14:21:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 981. [2023-12-02 14:21:30,614 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 14:21:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1199 transitions. [2023-12-02 14:21:30,616 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1199 transitions. Word has length 68 [2023-12-02 14:21:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:21:30,616 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1199 transitions. [2023-12-02 14:21:30,617 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 14:21:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1199 transitions. [2023-12-02 14:21:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-02 14:21:30,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:21:30,617 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 14:21:30,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-02 14:21:30,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 14:21:31,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-02 14:21:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:21:31,218 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 14:21:31,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:21:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1482008037, now seen corresponding path program 1 times [2023-12-02 14:21:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:21:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164394768] [2023-12-02 14:21:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:21:31,219 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 14:21:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:21:31,220 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:21:31,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:21:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:21:31,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 14:21:31,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:31,617 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 14:21:31,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:32,004 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 14:21:32,004 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:21:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164394768] [2023-12-02 14:21:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164394768] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:21:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1813151169] [2023-12-02 14:21:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:21:32,005 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:21:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:21:32,006 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:21:32,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 14:21:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:21:32,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 14:21:32,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:32,540 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 14:21:32,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:32,643 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 14:21:32,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1813151169] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:21:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252523416] [2023-12-02 14:21:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:21:32,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:21:32,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:21:32,644 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:21:32,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 14:21:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:21:32,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 14:21:32,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:33,064 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 14:21:33,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:33,813 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 14:21:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252523416] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:21:33,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:21:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 14:21:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139039693] [2023-12-02 14:21:33,814 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:21:33,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 14:21:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:21:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 14:21:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 14:21:33,816 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 14:21:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:21:40,365 INFO L93 Difference]: Finished difference Result 1011 states and 1244 transitions. [2023-12-02 14:21:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 14:21:40,366 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 14:21:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:21:40,370 INFO L225 Difference]: With dead ends: 1011 [2023-12-02 14:21:40,370 INFO L226 Difference]: Without dead ends: 1008 [2023-12-02 14:21:40,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 14:21:40,372 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 26 mSDsluCounter, 10942 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11673 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:21:40,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 11673 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-12-02 14:21:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-12-02 14:21:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 999. [2023-12-02 14:21:40,385 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 14:21:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1222 transitions. [2023-12-02 14:21:40,386 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1222 transitions. Word has length 74 [2023-12-02 14:21:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:21:40,386 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1222 transitions. [2023-12-02 14:21:40,387 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 14:21:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1222 transitions. [2023-12-02 14:21:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 14:21:40,387 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:21:40,388 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 14:21:40,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 14:21:40,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-12-02 14:21:40,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:21:40,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:21:40,989 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 14:21:40,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:21:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1225931803, now seen corresponding path program 2 times [2023-12-02 14:21:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:21:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990110442] [2023-12-02 14:21:40,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:21:40,990 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 14:21:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:21:40,991 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:21:40,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:21:41,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:21:41,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:21:41,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 14:21:41,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:42,031 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 14:21:42,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:44,157 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 14:21:44,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:21:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990110442] [2023-12-02 14:21:44,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990110442] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:21:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949075331] [2023-12-02 14:21:44,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:21:44,158 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:21:44,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:21:44,158 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:21:44,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 14:21:45,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:21:45,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:21:45,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 14:21:45,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:45,907 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 14:21:45,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:46,435 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 14:21:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [949075331] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:21:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714154213] [2023-12-02 14:21:46,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:21:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:21:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:21:46,436 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:21:46,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 14:22:00,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:22:00,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:22:00,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 14:22:00,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:00,045 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 14:22:00,189 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:22:00,189 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 14:22:00,194 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 14:22:00,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:22:00,287 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 14:22:00,593 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 14:22:00,597 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 14:22:01,141 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:22:01,141 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 14:22:01,151 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 14:22:01,302 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 14:22:01,306 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 14:22:01,381 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 14:22:01,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:02,220 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 14:22:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714154213] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:22:02,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 14:22:02,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2023-12-02 14:22:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107327780] [2023-12-02 14:22:02,227 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 14:22:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-02 14:22:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:22:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-02 14:22:02,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2023-12-02 14:22:02,229 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 14:22:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:22:43,901 INFO L93 Difference]: Finished difference Result 1467 states and 1856 transitions. [2023-12-02 14:22:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-02 14:22:43,901 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 14:22:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:22:43,908 INFO L225 Difference]: With dead ends: 1467 [2023-12-02 14:22:43,909 INFO L226 Difference]: Without dead ends: 1460 [2023-12-02 14:22:43,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3720 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3451, Invalid=16012, Unknown=1, NotChecked=276, Total=19740 [2023-12-02 14:22:43,914 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 774 mSDsluCounter, 10885 mSDsCounter, 0 mSdLazyCounter, 16441 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 11302 SdHoareTripleChecker+Invalid, 16509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 16441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:22:43,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 11302 Invalid, 16509 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 16441 Invalid, 0 Unknown, 0 Unchecked, 30.6s Time] [2023-12-02 14:22:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2023-12-02 14:22:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1034. [2023-12-02 14:22:43,935 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 14:22:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1265 transitions. [2023-12-02 14:22:43,936 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1265 transitions. Word has length 86 [2023-12-02 14:22:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:22:43,936 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1265 transitions. [2023-12-02 14:22:43,937 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 14:22:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1265 transitions. [2023-12-02 14:22:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 14:22:43,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:22:43,938 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 14:22:43,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 14:22:44,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:22:44,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 14:22:44,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:22:44,538 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 14:22:44,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:22:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash 480841229, now seen corresponding path program 1 times [2023-12-02 14:22:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:22:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465532672] [2023-12-02 14:22:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:44,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:44,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:22:44,541 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:22:44,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:22:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:45,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 14:22:45,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:45,272 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 14:22:45,377 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:22:45,377 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 14:22:45,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:22:45,498 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 14:22:46,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:22:46,393 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 14:22:46,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:22:46,515 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 14:22:46,530 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 14:22:46,571 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 14:22:46,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:48,690 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 14:22:49,087 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 14:22:49,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:22:49,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465532672] [2023-12-02 14:22:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465532672] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:22:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [637361095] [2023-12-02 14:22:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:49,090 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:22:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:22:49,091 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:22:49,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 14:22:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:51,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 14:22:51,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:51,219 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 14:22:51,484 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:22:51,484 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 14:22:51,544 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 14:22:51,670 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 14:22:52,561 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:22:52,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 36 treesize of output 35 [2023-12-02 14:22:52,728 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:22:52,728 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 14:22:52,760 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 14:22:52,777 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 14:22:52,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:52,794 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_3784) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 14:22:52,807 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 14:22:53,212 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3830))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3784)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:22:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [637361095] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:22:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599307958] [2023-12-02 14:22:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:53,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:22:53,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:22:53,216 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:22:53,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 14:22:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:53,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 14:22:53,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:53,886 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:22:53,887 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 14:22:53,923 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 14:22:54,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:22:54,290 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 14:22:54,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:22:54,378 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 14:22:54,437 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 14:22:54,441 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 14:22:54,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:54,463 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:22:54,463 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 14:22:54,556 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 14:22:54,937 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 14:22:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599307958] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:22:54,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:22:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-12-02 14:22:54,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684780496] [2023-12-02 14:22:54,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:22:54,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 14:22:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:22:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 14:22:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=529, Unknown=24, NotChecked=378, Total=1056 [2023-12-02 14:22:54,941 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 14:23:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:23:03,831 INFO L93 Difference]: Finished difference Result 1440 states and 1797 transitions. [2023-12-02 14:23:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 14:23:03,832 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 14:23:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:23:03,839 INFO L225 Difference]: With dead ends: 1440 [2023-12-02 14:23:03,840 INFO L226 Difference]: Without dead ends: 1440 [2023-12-02 14:23:03,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=136, Invalid=570, Unknown=24, NotChecked=392, Total=1122 [2023-12-02 14:23:03,841 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 730 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 4524 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 4551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:23:03,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 3920 Invalid, 4551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4524 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-12-02 14:23:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2023-12-02 14:23:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1033. [2023-12-02 14:23:03,855 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 14:23:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1264 transitions. [2023-12-02 14:23:03,856 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1264 transitions. Word has length 110 [2023-12-02 14:23:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:23:03,857 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1264 transitions. [2023-12-02 14:23:03,857 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 14:23:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1264 transitions. [2023-12-02 14:23:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 14:23:03,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:23:03,857 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 14:23:03,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 14:23:04,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-12-02 14:23:04,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:04,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:04,458 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 14:23:04,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:23:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash 480841230, now seen corresponding path program 1 times [2023-12-02 14:23:04,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:23:04,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097182717] [2023-12-02 14:23:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:23:04,459 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 14:23:04,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:23:04,460 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:04,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:23:05,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 14:23:05,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:23:05,217 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 14:23:05,490 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 14:23:05,507 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:23:05,507 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 14:23:05,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:23:05,549 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 14:23:05,653 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 14:23:05,658 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 14:23:06,313 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:23:06,313 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 14:23:06,322 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 14:23:06,410 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:23:06,410 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 14:23:06,418 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 14:23:06,428 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 14:23:06,433 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 14:23:06,455 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 14:23:06,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:23:06,587 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 14:23:06,621 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 14:23:07,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_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 14:23:07,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:23:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097182717] [2023-12-02 14:23:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097182717] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:23:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [337995166] [2023-12-02 14:23:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:23:07,826 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:23:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:23:07,827 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:23:07,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 14:23:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:23:11,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 14:23:11,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:23:11,454 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 14:23:11,460 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 14:23:11,842 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 14:23:11,842 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 14:23:11,863 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:23:11,863 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 14:23:11,920 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 14:23:11,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 14:23:12,014 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 14:23:12,077 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 14:23:12,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:23:12,624 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 14:23:12,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2023-12-02 14:23:12,884 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 14:23:13,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:23:13,027 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 14:23:13,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:23:13,037 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 14:23:13,132 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 14:23:13,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:23:13,476 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 14:23:18,938 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 14:23:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [337995166] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:23:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945172088] [2023-12-02 14:23:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:23:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:23:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:23:19,103 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:23:19,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 14:23:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:23:19,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 14:23:19,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:23:19,697 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 14:23:20,061 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:23:20,061 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 14:23:20,072 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 14:23:20,224 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 14:23:20,246 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 14:23:20,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 14:23:20,652 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 14:23:21,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:23:21,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:23:21,765 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 14:23:22,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:23:22,169 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 14:23:22,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 14:23:22,207 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 14:23:22,219 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 14:23:22,226 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 14:23:22,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:23:22,298 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 14:23:22,349 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 14:23:23,987 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 14:23:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945172088] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:23:23,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:23:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2023-12-02 14:23:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186133551] [2023-12-02 14:23:23,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:23:23,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 14:23:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:23:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 14:23:24,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=718, Unknown=7, NotChecked=420, Total=1260 [2023-12-02 14:23:24,000 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 14:23:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:23:49,758 INFO L93 Difference]: Finished difference Result 1438 states and 1795 transitions. [2023-12-02 14:23:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:23:49,759 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 14:23:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:23:49,764 INFO L225 Difference]: With dead ends: 1438 [2023-12-02 14:23:49,764 INFO L226 Difference]: Without dead ends: 1438 [2023-12-02 14:23:49,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 308 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=210, Invalid=1143, Unknown=7, NotChecked=532, Total=1892 [2023-12-02 14:23:49,765 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 1393 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 6546 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 6570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:23:49,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 2753 Invalid, 6570 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6546 Invalid, 0 Unknown, 0 Unchecked, 24.7s Time] [2023-12-02 14:23:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-12-02 14:23:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1032. [2023-12-02 14:23:49,778 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 14:23:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1263 transitions. [2023-12-02 14:23:49,779 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1263 transitions. Word has length 110 [2023-12-02 14:23:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:23:49,780 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 1263 transitions. [2023-12-02 14:23:49,780 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 14:23:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1263 transitions. [2023-12-02 14:23:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 14:23:49,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:23:49,781 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 14:23:49,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2023-12-02 14:23:49,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 14:23:50,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:50,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:50,381 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 14:23:50,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:23:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1766673317, now seen corresponding path program 1 times [2023-12-02 14:23:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:23:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964905764] [2023-12-02 14:23:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:23:50,383 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 14:23:50,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:23:50,383 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:50,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:23:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:23:51,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 14:23:51,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:23:51,294 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 14:23:51,602 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:23:51,603 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 14:23:51,670 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 14:23:51,821 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 14:23:53,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:23:53,281 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 14:23:53,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:23:53,487 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 14:23:53,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:23:53,635 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 14:23:53,656 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 14:23:53,727 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 14:23:53,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:23:53,847 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 14:23:53,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6335) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 14:23:53,890 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 14:23:53,913 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 14:23:54,453 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 14:23:54,458 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:23:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964905764] [2023-12-02 14:23:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964905764] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:23:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1013272075] [2023-12-02 14:23:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:23:54,458 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:23:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:23:54,459 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:23:54,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 14:24:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:19,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 14:24:19,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:19,238 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 14:24:19,894 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:24:19,895 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 14:24:20,035 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 14:24:20,298 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 14:24:21,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:24:21,718 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 14:24:22,013 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:24:22,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 14:24:22,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:24:22,200 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 14:24:22,230 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 14:24:22,248 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 14:24:22,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:24:22,275 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 14:24:24,407 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 14:24:24,431 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 14:24:24,990 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 14:24:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1013272075] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:24:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973645995] [2023-12-02 14:24:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:24,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:24:24,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:24:24,997 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:24:25,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 14:24:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:25,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 14:24:25,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:25,641 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 14:24:25,924 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:24:25,925 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 14:24:26,002 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 14:24:26,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:24:26,838 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 14:24:26,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:24:26,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:24:29,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:24:29,265 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 14:24:29,285 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 14:24:29,292 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 14:24:29,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:24:29,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 14:24:29,341 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 14:24:29,375 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 14:24:29,375 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 14:24:29,390 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 14:24:29,408 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 14:24:29,917 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 14:24:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973645995] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:24:29,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:24:29,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2023-12-02 14:24:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131207322] [2023-12-02 14:24:29,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:24:29,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 14:24:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:24:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 14:24:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=630, Unknown=16, NotChecked=910, Total=1722 [2023-12-02 14:24:29,923 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 14:24:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:51,449 INFO L93 Difference]: Finished difference Result 1438 states and 1795 transitions. [2023-12-02 14:24:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 14:24:51,450 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 14:24:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:51,454 INFO L225 Difference]: With dead ends: 1438 [2023-12-02 14:24:51,454 INFO L226 Difference]: Without dead ends: 1438 [2023-12-02 14:24:51,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=178, Invalid=674, Unknown=16, NotChecked=938, Total=1806 [2023-12-02 14:24:51,455 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 721 mSDsluCounter, 4663 mSDsCounter, 0 mSdLazyCounter, 5863 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 5072 SdHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:51,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 5072 Invalid, 5879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5863 Invalid, 0 Unknown, 0 Unchecked, 21.2s Time] [2023-12-02 14:24:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-12-02 14:24:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1031. [2023-12-02 14:24:51,469 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 14:24:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1262 transitions. [2023-12-02 14:24:51,471 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1262 transitions. Word has length 112 [2023-12-02 14:24:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:51,471 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1262 transitions. [2023-12-02 14:24:51,471 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 14:24:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1262 transitions. [2023-12-02 14:24:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 14:24:51,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:51,472 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 14:24:51,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 14:24:51,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-12-02 14:24:51,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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)] Forceful destruction successful, exit code 0 [2023-12-02 14:24:52,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:24:52,073 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 14:24:52,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:52,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1766673316, now seen corresponding path program 1 times [2023-12-02 14:24:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607696391] [2023-12-02 14:24:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:52,074 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 14:24:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:52,075 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:24:52,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:24:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:53,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 14:24:53,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:53,050 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 14:24:53,615 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:24:53,616 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 14:24:53,628 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 14:24:53,702 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 14:24:53,715 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 14:24:53,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 14:24:53,906 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 14:24:55,183 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:24:55,183 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 14:24:55,191 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 14:24:55,401 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:24:55,401 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 14:24:55,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 14:24:55,583 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:24:55,584 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 14:24:55,592 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 14:24:55,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 25 treesize of output 13 [2023-12-02 14:24:55,639 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 14:24:55,699 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 14:24:55,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:24:55,950 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 14:24:55,993 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 14:24:56,051 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 14:24:56,113 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 14:24:57,735 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 14:24:57,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607696391] [2023-12-02 14:24:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607696391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:24:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1672017862] [2023-12-02 14:24:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:57,751 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:24:57,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:24:57,752 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:24:57,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 14:25:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:25:44,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 14:25:44,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:25:44,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 14:25:45,304 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:25:45,304 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 14:25:45,324 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 14:25:45,346 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 14:25:45,358 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 14:25:45,464 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 14:25:45,470 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 14:25:46,665 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:25:46,665 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 14:25:46,673 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 14:25:46,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:25:46,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 50 treesize of output 45 [2023-12-02 14:25:46,834 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 14:25:46,910 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:25:46,911 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 14:25:46,930 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 14:25:46,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 14:25:46,964 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 14:25:46,978 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 14:25:46,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:25:47,057 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 14:25:47,099 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 14:25:47,154 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 14:25:47,208 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 14:25:49,276 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 14:25:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1672017862] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:25:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399961889] [2023-12-02 14:25:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:25:49,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:25:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:25:49,294 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:25:49,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 14:25:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:25:50,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 14:25:50,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:25:50,032 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 14:25:50,353 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 14:25:50,383 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:25:50,384 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 14:25:50,478 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 14:25:50,496 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 14:25:50,742 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 14:25:50,749 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 14:25:51,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:25:51,910 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 14:25:51,932 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 14:25:52,191 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:25:52,192 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 14:25:52,200 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 14:25:52,374 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:25:52,375 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 14:25:52,389 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 14:25:52,423 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 14:25:52,438 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 14:25:52,439 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 14:25:52,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:25:52,523 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 14:25:52,565 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 14:25:52,640 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 14:25:52,691 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 14:25:55,221 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 14:25:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399961889] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:25:55,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:25:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 14:25:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635343888] [2023-12-02 14:25:55,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:25:55,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 14:25:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:25:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 14:25:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 14:25:55,239 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 14:26:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:26:14,269 INFO L93 Difference]: Finished difference Result 1436 states and 1793 transitions. [2023-12-02 14:26:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:26:14,270 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 14:26:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:26:14,273 INFO L225 Difference]: With dead ends: 1436 [2023-12-02 14:26:14,273 INFO L226 Difference]: Without dead ends: 1436 [2023-12-02 14:26:14,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 14:26:14,274 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 716 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 5146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:26:14,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2474 Invalid, 5146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2023-12-02 14:26:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2023-12-02 14:26:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1030. [2023-12-02 14:26:14,289 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 14:26:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1261 transitions. [2023-12-02 14:26:14,292 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1261 transitions. Word has length 112 [2023-12-02 14:26:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:26:14,292 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1261 transitions. [2023-12-02 14:26:14,292 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 14:26:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1261 transitions. [2023-12-02 14:26:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 14:26:14,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:26:14,293 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 14:26:14,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-02 14:26:14,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 14:26:14,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2023-12-02 14:26:14,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:26:14,894 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 14:26:14,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:26:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1259607676, now seen corresponding path program 1 times [2023-12-02 14:26:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:26:14,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305036241] [2023-12-02 14:26:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:26:14,896 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 14:26:14,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:26:14,896 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:26:14,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:26:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:26:16,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 14:26:16,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:26:16,146 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 14:26:16,431 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 14:26:16,464 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:26:16,464 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 14:26:16,520 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 14:26:16,551 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 14:26:16,746 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 14:26:16,754 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 14:26:18,111 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:26:18,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:26:18,127 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 14:26:18,347 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:26:18,347 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 14:26:18,356 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 14:26:18,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:26:18,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:26:18,567 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 14:26:18,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:26:18,747 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 14:26:18,769 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 14:26:18,787 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 14:26:18,800 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 14:26:18,867 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 14:26:18,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:26:19,123 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 14:26:19,170 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 14:26:19,370 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 14:26:19,433 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 14:26:21,001 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 14:26:31,359 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 14:26:31,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:26:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305036241] [2023-12-02 14:26:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305036241] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:26:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [399525871] [2023-12-02 14:26:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:26:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:26:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:26:31,392 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:26:31,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 14:31:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:31:42,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 14:31:42,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:31:42,882 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 14:31:45,523 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 14:31:45,651 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:31:45,651 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 14:31:46,094 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 14:31:46,144 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 14:31:47,363 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 14:31:47,390 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 14:31:52,191 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:31:52,192 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 14:31:52,267 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 14:31:53,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:31:53,447 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 14:31:53,474 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 14:31:54,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:31:54,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 14:31:54,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 14:31:55,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:31:55,109 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 14:31:55,184 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 14:31:55,285 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 14:31:55,335 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 14:31:55,337 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 14:31:55,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:31:55,565 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 14:31:55,679 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 14:31:55,899 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 14:31:56,102 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 14:31:56,749 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 14:31:58,919 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 14:32:04,872 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 14:32:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [399525871] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:32:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904357465] [2023-12-02 14:32:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:04,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:32:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:32:04,899 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:32:04,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 14:32:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:05,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 14:32:05,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:05,712 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 14:32:06,992 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:32:06,993 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 14:32:07,042 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 14:32:07,121 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 14:32:07,224 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 14:32:07,512 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 14:32:07,539 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 14:32:12,322 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:12,322 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 14:32:12,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 14:32:12,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:12,844 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 14:32:12,921 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 14:32:13,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:13,202 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 14:32:13,255 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 14:32:13,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:13,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:32:13,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 14:32:13,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 14:32:13,751 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 14:32:13,776 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 14:32:13,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:32:13,987 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 14:32:14,104 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 14:32:14,226 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 14:32:14,353 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 14:32:15,250 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 14:32:16,918 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 14:32:21,637 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 14:32:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904357465] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:32:21,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:32:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2023-12-02 14:32:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449781007] [2023-12-02 14:32:21,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:32:21,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 14:32:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:32:21,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 14:32:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=396, Unknown=24, NotChecked=1180, Total=1722 [2023-12-02 14:32:21,676 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) [2023-12-02 14:33:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:33:32,086 INFO L93 Difference]: Finished difference Result 1435 states and 1792 transitions. [2023-12-02 14:33:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 14:33:32,087 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 114 [2023-12-02 14:33:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:33:32,091 INFO L225 Difference]: With dead ends: 1435 [2023-12-02 14:33:32,091 INFO L226 Difference]: Without dead ends: 1435 [2023-12-02 14:33:32,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 324 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=191, Invalid=677, Unknown=24, NotChecked=1460, Total=2352 [2023-12-02 14:33:32,093 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 716 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 5151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 5160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 5151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:33:32,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2472 Invalid, 5160 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 5151 Invalid, 0 Unknown, 0 Unchecked, 68.3s Time] [2023-12-02 14:33:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2023-12-02 14:33:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1029. [2023-12-02 14:33:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 661 states have (on average 1.8774583963691376) internal successors, (1241), 1021 states have internal predecessors, (1241), 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 14:33:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1260 transitions. [2023-12-02 14:33:32,110 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1260 transitions. Word has length 114 [2023-12-02 14:33:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:33:32,111 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1260 transitions. [2023-12-02 14:33:32,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-12-02 14:33:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1260 transitions. [2023-12-02 14:33:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 14:33:32,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:33:32,112 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 14:33:32,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-12-02 14:33:32,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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)] Ended with exit code 0 [2023-12-02 14:33:32,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2023-12-02 14:33:32,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:33:32,713 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 530 more)] === [2023-12-02 14:33:32,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:33:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1259607677, now seen corresponding path program 1 times [2023-12-02 14:33:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:33:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80734932] [2023-12-02 14:33:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:33:32,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:33:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:33:32,716 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 14:33:32,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/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 (45)] Waiting until timeout for monitored process [2023-12-02 14:33:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:33:33,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 14:33:34,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:33:34,025 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 14:33:35,487 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:33:35,487 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 14:33:35,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 14:33:36,370 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 14:33:42,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:42,167 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 14:33:42,970 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:42,970 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 14:33:43,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:43,585 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 14:33:44,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:44,181 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 14:33:44,283 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 14:33:44,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 14:33:44,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:33:47,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11333 (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_11333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 14:33:47,585 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11333 (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~mem41#1.base| v_ArrVal_11332))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:33:47,674 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11333 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11332))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:33:47,765 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11333 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11331))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11332)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:33:47,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11333 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11331))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11332)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:33:49,546 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11333 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11379))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11331)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11332)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:33:49,562 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:33:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80734932] [2023-12-02 14:33:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80734932] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:33:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [735513398] [2023-12-02 14:33:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:33:49,563 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:33:49,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:33:49,564 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:33:49,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8dd26f-95d2-4ed8-8b0c-571746923719/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process