./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:26:47,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:26:47,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:26:47,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:26:47,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:26:47,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:26:47,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:26:47,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:26:47,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:26:47,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:26:47,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:26:47,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:26:47,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:26:47,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:26:47,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:26:47,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:26:47,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:26:47,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:26:47,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:26:47,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:26:47,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:26:47,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:26:47,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:26:47,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:26:47,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:26:47,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:26:47,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:26:47,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:26:47,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:26:47,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:26:47,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:26:47,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:26:47,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:26:47,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:26:47,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:26:47,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:26:47,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:26:47,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:26:47,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:26:47,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:26:47,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:26:47,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:26:47,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:26:47,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:26:47,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:26:47,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:26:47,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:26:47,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:26:47,772 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:26:47,772 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:26:47,772 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:26:47,772 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:26:47,774 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:26:47,774 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:26:47,774 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:26:47,774 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:26:47,775 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:26:47,775 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:26:47,775 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:26:47,775 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:26:47,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:26:47,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:26:47,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:26:47,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:26:47,777 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:26:47,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:26:47,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:26:47,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:26:47,779 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:26:47,779 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:26:47,779 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:26:47,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:26:47,780 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:26:47,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:26:47,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:26:47,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:26:47,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:26:47,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:26:47,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:26:47,782 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:26:47,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:26:47,782 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:26:47,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:26:47,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:26:47,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/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_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2022-11-25 23:26:48,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:26:48,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:26:48,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:26:48,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:26:48,154 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:26:48,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-11-25 23:26:51,231 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:26:51,668 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:26:51,669 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-11-25 23:26:51,711 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data/5518a8e2e/30084a580ab7414b84fc88f7280d9a75/FLAG93d50f98f [2022-11-25 23:26:51,729 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data/5518a8e2e/30084a580ab7414b84fc88f7280d9a75 [2022-11-25 23:26:51,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:26:51,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:26:51,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:26:51,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:26:51,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:26:51,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:26:51" (1/1) ... [2022-11-25 23:26:51,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4deacb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:51, skipping insertion in model container [2022-11-25 23:26:51,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:26:51" (1/1) ... [2022-11-25 23:26:51,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:26:51,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:26:52,427 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-11-25 23:26:52,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:26:52,697 ERROR L326 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) [2022-11-25 23:26:52,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54a14665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:52, skipping insertion in model container [2022-11-25 23:26:52,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:26:52,698 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 23:26:52,700 INFO L158 Benchmark]: Toolchain (without parser) took 961.13ms. Allocated memory is still 182.5MB. Free memory was 147.4MB in the beginning and 125.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 23:26:52,701 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:26:52,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 957.36ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 125.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 23:26:52,703 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 957.36ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 125.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:26:55,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:26:55,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:26:55,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:26:55,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:26:55,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:26:55,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:26:55,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:26:55,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:26:55,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:26:55,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:26:55,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:26:55,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:26:55,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:26:55,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:26:55,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:26:55,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:26:55,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:26:55,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:26:55,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:26:55,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:26:55,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:26:55,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:26:55,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:26:55,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:26:55,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:26:55,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:26:55,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:26:55,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:26:55,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:26:55,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:26:55,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:26:55,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:26:55,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:26:55,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:26:55,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:26:55,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:26:55,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:26:55,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:26:55,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:26:55,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:26:55,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 23:26:55,368 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:26:55,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:26:55,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:26:55,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:26:55,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:26:55,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:26:55,374 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:26:55,374 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:26:55,374 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:26:55,374 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:26:55,376 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:26:55,376 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:26:55,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:26:55,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:26:55,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:26:55,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:26:55,378 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:26:55,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:26:55,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:26:55,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:26:55,379 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:26:55,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:26:55,380 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:26:55,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:26:55,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:26:55,381 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:26:55,381 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:26:55,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:26:55,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:26:55,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:26:55,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:26:55,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:26:55,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:26:55,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:26:55,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:26:55,384 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:26:55,384 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:26:55,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:26:55,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:26:55,384 INFO L138 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_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/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_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2022-11-25 23:26:55,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:26:55,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:26:55,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:26:55,852 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:26:55,853 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:26:55,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-11-25 23:26:59,112 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:26:59,578 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:26:59,585 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-11-25 23:26:59,606 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data/ee7ca3350/088cc45cc41042cbb8f9bd8fa0862d6f/FLAGd0c8e508c [2022-11-25 23:26:59,629 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/data/ee7ca3350/088cc45cc41042cbb8f9bd8fa0862d6f [2022-11-25 23:26:59,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:26:59,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:26:59,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:26:59,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:26:59,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:26:59,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:26:59" (1/1) ... [2022-11-25 23:26:59,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6b6f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:59, skipping insertion in model container [2022-11-25 23:26:59,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:26:59" (1/1) ... [2022-11-25 23:26:59,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:26:59,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:27:00,257 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-11-25 23:27:00,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:27:00,569 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 23:27:00,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:27:00,637 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-11-25 23:27:00,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:27:00,787 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:27:00,819 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-11-25 23:27:00,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:27:00,942 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:27:00,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00 WrapperNode [2022-11-25 23:27:00,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:27:00,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:27:00,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:27:00,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:27:00,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,103 INFO L138 Inliner]: procedures = 180, calls = 448, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1465 [2022-11-25 23:27:01,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:27:01,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:27:01,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:27:01,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:27:01,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,229 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:27:01,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:27:01,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:27:01,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:27:01,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (1/1) ... [2022-11-25 23:27:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:27:01,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:27:01,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:27:01,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:27:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 23:27:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 23:27:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 23:27:01,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 23:27:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 23:27:01,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 23:27:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:27:01,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:27:01,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:27:01,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:27:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:27:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:27:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 23:27:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:27:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:27:01,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:27:01,824 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:27:01,827 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:27:01,832 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 23:27:10,141 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:27:10,164 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:27:10,167 INFO L300 CfgBuilder]: Removed 77 assume(true) statements. [2022-11-25 23:27:10,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:27:10 BoogieIcfgContainer [2022-11-25 23:27:10,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:27:10,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:27:10,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:27:10,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:27:10,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:26:59" (1/3) ... [2022-11-25 23:27:10,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234632aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:27:10, skipping insertion in model container [2022-11-25 23:27:10,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:27:00" (2/3) ... [2022-11-25 23:27:10,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234632aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:27:10, skipping insertion in model container [2022-11-25 23:27:10,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:27:10" (3/3) ... [2022-11-25 23:27:10,189 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2022-11-25 23:27:10,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:27:10,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2022-11-25 23:27:10,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:27:10,353 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;@2f130210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:27:10,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2022-11-25 23:27:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 1649 states, 785 states have (on average 2.2840764331210193) internal successors, (1793), 1640 states have internal predecessors, (1793), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:27:10,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:10,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:27:10,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-25 23:27:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:10,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805708211] [2022-11-25 23:27:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:10,404 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 [2022-11-25 23:27:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:10,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:10,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:10,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 23:27:10,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:10,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:10,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:10,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805708211] [2022-11-25 23:27:10,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805708211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:10,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:10,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:27:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661270515] [2022-11-25 23:27:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:10,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:27:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:27:10,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:27:10,721 INFO L87 Difference]: Start difference. First operand has 1649 states, 785 states have (on average 2.2840764331210193) internal successors, (1793), 1640 states have internal predecessors, (1793), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:10,824 INFO L93 Difference]: Finished difference Result 1631 states and 1722 transitions. [2022-11-25 23:27:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:27:10,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-25 23:27:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:10,878 INFO L225 Difference]: With dead ends: 1631 [2022-11-25 23:27:10,878 INFO L226 Difference]: Without dead ends: 1629 [2022-11-25 23:27:10,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:27:10,884 INFO L413 NwaCegarLoop]: 1722 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:10,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:27:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-11-25 23:27:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-11-25 23:27:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 776 states have (on average 2.1752577319587627) internal successors, (1688), 1620 states have internal predecessors, (1688), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 1720 transitions. [2022-11-25 23:27:11,043 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 1720 transitions. Word has length 5 [2022-11-25 23:27:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:11,044 INFO L495 AbstractCegarLoop]: Abstraction has 1629 states and 1720 transitions. [2022-11-25 23:27:11,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1720 transitions. [2022-11-25 23:27:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:27:11,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:11,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:27:11,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 23:27:11,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:11,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-25 23:27:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:11,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072659588] [2022-11-25 23:27:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:11,261 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 [2022-11-25 23:27:11,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:11,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:11,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:11,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:27:11,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:11,648 INFO L350 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 [2022-11-25 23:27:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:11,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:11,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:11,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072659588] [2022-11-25 23:27:11,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072659588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:11,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:11,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:27:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247321246] [2022-11-25 23:27:11,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:11,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:27:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:27:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:11,679 INFO L87 Difference]: Start difference. First operand 1629 states and 1720 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:15,757 INFO L93 Difference]: Finished difference Result 1666 states and 1770 transitions. [2022-11-25 23:27:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:27:15,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-25 23:27:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:15,765 INFO L225 Difference]: With dead ends: 1666 [2022-11-25 23:27:15,765 INFO L226 Difference]: Without dead ends: 1666 [2022-11-25 23:27:15,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:15,771 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 1155 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:15,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1287 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 23:27:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-11-25 23:27:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1612. [2022-11-25 23:27:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 852 states have (on average 2.0305164319248825) internal successors, (1730), 1603 states have internal predecessors, (1730), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1762 transitions. [2022-11-25 23:27:15,841 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1762 transitions. Word has length 5 [2022-11-25 23:27:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:15,842 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 1762 transitions. [2022-11-25 23:27:15,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1762 transitions. [2022-11-25 23:27:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:27:15,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:15,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:27:15,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:16,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:16,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-25 23:27:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:16,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777638157] [2022-11-25 23:27:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:16,057 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 [2022-11-25 23:27:16,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:16,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:16,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:16,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:27:16,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:16,246 INFO L350 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 [2022-11-25 23:27:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:16,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:16,277 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:16,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777638157] [2022-11-25 23:27:16,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777638157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:16,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:16,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:27:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119322620] [2022-11-25 23:27:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:16,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:27:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:16,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:27:16,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:16,284 INFO L87 Difference]: Start difference. First operand 1612 states and 1762 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:21,436 INFO L93 Difference]: Finished difference Result 1915 states and 2085 transitions. [2022-11-25 23:27:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:27:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-25 23:27:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:21,444 INFO L225 Difference]: With dead ends: 1915 [2022-11-25 23:27:21,445 INFO L226 Difference]: Without dead ends: 1915 [2022-11-25 23:27:21,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:21,446 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 504 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:21,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2068 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 23:27:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-11-25 23:27:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1768. [2022-11-25 23:27:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1018 states have (on average 2.0) internal successors, (2036), 1759 states have internal predecessors, (2036), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2068 transitions. [2022-11-25 23:27:21,488 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2068 transitions. Word has length 5 [2022-11-25 23:27:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:21,489 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2068 transitions. [2022-11-25 23:27:21,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2068 transitions. [2022-11-25 23:27:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:27:21,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:21,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:27:21,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:21,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:21,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-25 23:27:21,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:21,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193019362] [2022-11-25 23:27:21,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:21,707 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 [2022-11-25 23:27:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:21,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:21,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:21,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:27:21,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:21,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:21,892 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:21,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193019362] [2022-11-25 23:27:21,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193019362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:21,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:21,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083352031] [2022-11-25 23:27:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:21,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:27:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:27:21,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:21,904 INFO L87 Difference]: Start difference. First operand 1768 states and 2068 transitions. Second operand has 3 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) [2022-11-25 23:27:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:22,079 INFO L93 Difference]: Finished difference Result 3110 states and 3671 transitions. [2022-11-25 23:27:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:27:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 [2022-11-25 23:27:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:22,098 INFO L225 Difference]: With dead ends: 3110 [2022-11-25 23:27:22,098 INFO L226 Difference]: Without dead ends: 3110 [2022-11-25 23:27:22,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:22,102 INFO L413 NwaCegarLoop]: 1840 mSDtfsCounter, 1139 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:22,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 3451 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:27:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2022-11-25 23:27:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 1769. [2022-11-25 23:27:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1019 states have (on average 1.999018645731109) internal successors, (2037), 1760 states have internal predecessors, (2037), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2069 transitions. [2022-11-25 23:27:22,171 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2069 transitions. Word has length 6 [2022-11-25 23:27:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:22,173 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2069 transitions. [2022-11-25 23:27:22,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-11-25 23:27:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2069 transitions. [2022-11-25 23:27:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:27:22,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:22,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:22,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:22,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:22,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-25 23:27:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:22,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762066114] [2022-11-25 23:27:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:22,394 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 [2022-11-25 23:27:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:22,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:22,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:22,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:27:22,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:22,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:22,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:22,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762066114] [2022-11-25 23:27:22,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762066114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:22,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:22,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938121747] [2022-11-25 23:27:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:22,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:27:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:22,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:27:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:22,621 INFO L87 Difference]: Start difference. First operand 1769 states and 2069 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:22,671 INFO L93 Difference]: Finished difference Result 1733 states and 2032 transitions. [2022-11-25 23:27:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:27:22,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 23:27:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:22,679 INFO L225 Difference]: With dead ends: 1733 [2022-11-25 23:27:22,679 INFO L226 Difference]: Without dead ends: 1733 [2022-11-25 23:27:22,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:22,680 INFO L413 NwaCegarLoop]: 1569 mSDtfsCounter, 1529 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:22,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1602 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:27:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-11-25 23:27:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1727. [2022-11-25 23:27:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1001 states have (on average 1.992007992007992) internal successors, (1994), 1718 states have internal predecessors, (1994), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2026 transitions. [2022-11-25 23:27:22,719 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2026 transitions. Word has length 11 [2022-11-25 23:27:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:22,719 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2026 transitions. [2022-11-25 23:27:22,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2026 transitions. [2022-11-25 23:27:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:27:22,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:22,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:22,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:22,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:22,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-25 23:27:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:22,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648024283] [2022-11-25 23:27:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:22,945 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 [2022-11-25 23:27:22,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:22,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:22,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:23,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:27:23,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:23,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:23,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648024283] [2022-11-25 23:27:23,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648024283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:23,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:27:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710565615] [2022-11-25 23:27:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:23,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:23,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:23,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:23,184 INFO L87 Difference]: Start difference. First operand 1727 states and 2026 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:23,297 INFO L93 Difference]: Finished difference Result 1712 states and 2004 transitions. [2022-11-25 23:27:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:23,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 23:27:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:23,305 INFO L225 Difference]: With dead ends: 1712 [2022-11-25 23:27:23,305 INFO L226 Difference]: Without dead ends: 1712 [2022-11-25 23:27:23,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:23,306 INFO L413 NwaCegarLoop]: 1524 mSDtfsCounter, 1510 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:23,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 3074 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:27:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-25 23:27:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1705. [2022-11-25 23:27:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 993 states have (on average 1.9788519637462236) internal successors, (1965), 1696 states have internal predecessors, (1965), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1997 transitions. [2022-11-25 23:27:23,351 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1997 transitions. Word has length 13 [2022-11-25 23:27:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:23,352 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 1997 transitions. [2022-11-25 23:27:23,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1997 transitions. [2022-11-25 23:27:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:27:23,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:23,353 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] [2022-11-25 23:27:23,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:23,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:23,574 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-25 23:27:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:23,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373986277] [2022-11-25 23:27:23,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:23,575 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 [2022-11-25 23:27:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:23,577 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:23,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:23,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:27:23,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:23,880 INFO L350 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 [2022-11-25 23:27:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:23,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:23,999 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:23,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373986277] [2022-11-25 23:27:23,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373986277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:23,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:24,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083059139] [2022-11-25 23:27:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:24,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:24,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:24,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:24,004 INFO L87 Difference]: Start difference. First operand 1705 states and 1997 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:30,158 INFO L93 Difference]: Finished difference Result 2517 states and 2814 transitions. [2022-11-25 23:27:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:27:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 23:27:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:30,167 INFO L225 Difference]: With dead ends: 2517 [2022-11-25 23:27:30,168 INFO L226 Difference]: Without dead ends: 2517 [2022-11-25 23:27:30,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:30,169 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 2751 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:30,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 1870 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-25 23:27:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2022-11-25 23:27:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 1701. [2022-11-25 23:27:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 993 states have (on average 1.9748237663645518) internal successors, (1961), 1692 states have internal predecessors, (1961), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1993 transitions. [2022-11-25 23:27:30,215 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1993 transitions. Word has length 27 [2022-11-25 23:27:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:30,216 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 1993 transitions. [2022-11-25 23:27:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1993 transitions. [2022-11-25 23:27:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:27:30,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:30,237 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] [2022-11-25 23:27:30,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:30,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:30,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-25 23:27:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:30,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461849796] [2022-11-25 23:27:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:30,452 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 [2022-11-25 23:27:30,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:30,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:30,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:30,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:27:30,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:30,697 INFO L350 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 [2022-11-25 23:27:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:30,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:30,956 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:30,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461849796] [2022-11-25 23:27:30,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461849796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:30,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:30,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964600969] [2022-11-25 23:27:30,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:30,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:30,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:30,958 INFO L87 Difference]: Start difference. First operand 1701 states and 1993 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:38,685 INFO L93 Difference]: Finished difference Result 2262 states and 2463 transitions. [2022-11-25 23:27:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:27:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 23:27:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:38,693 INFO L225 Difference]: With dead ends: 2262 [2022-11-25 23:27:38,694 INFO L226 Difference]: Without dead ends: 2262 [2022-11-25 23:27:38,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:38,695 INFO L413 NwaCegarLoop]: 1160 mSDtfsCounter, 1247 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:38,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2524 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-25 23:27:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-11-25 23:27:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1697. [2022-11-25 23:27:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 993 states have (on average 1.9707955689828802) internal successors, (1957), 1688 states have internal predecessors, (1957), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1989 transitions. [2022-11-25 23:27:38,736 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1989 transitions. Word has length 27 [2022-11-25 23:27:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:38,736 INFO L495 AbstractCegarLoop]: Abstraction has 1697 states and 1989 transitions. [2022-11-25 23:27:38,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1989 transitions. [2022-11-25 23:27:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:27:38,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:38,738 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] [2022-11-25 23:27:38,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:38,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:38,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:38,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-25 23:27:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:38,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771964760] [2022-11-25 23:27:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:38,953 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 [2022-11-25 23:27:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:38,954 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:38,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:39,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:27:39,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:39,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:39,327 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:39,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771964760] [2022-11-25 23:27:39,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771964760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:39,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:39,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:27:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281170836] [2022-11-25 23:27:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:39,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:39,330 INFO L87 Difference]: Start difference. First operand 1697 states and 1989 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:39,420 INFO L93 Difference]: Finished difference Result 1697 states and 1985 transitions. [2022-11-25 23:27:39,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:39,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-11-25 23:27:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:39,426 INFO L225 Difference]: With dead ends: 1697 [2022-11-25 23:27:39,427 INFO L226 Difference]: Without dead ends: 1697 [2022-11-25 23:27:39,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:39,428 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 1479 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:39,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 3052 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:27:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-11-25 23:27:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1691. [2022-11-25 23:27:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 987 states have (on average 1.972644376899696) internal successors, (1947), 1682 states have internal predecessors, (1947), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 1979 transitions. [2022-11-25 23:27:39,470 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 1979 transitions. Word has length 42 [2022-11-25 23:27:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:39,472 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 1979 transitions. [2022-11-25 23:27:39,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1979 transitions. [2022-11-25 23:27:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 23:27:39,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:39,477 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] [2022-11-25 23:27:39,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:39,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:39,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-25 23:27:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608491736] [2022-11-25 23:27:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:39,693 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 [2022-11-25 23:27:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:39,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:39,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:39,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:27:39,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:40,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:40,240 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:40,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608491736] [2022-11-25 23:27:40,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608491736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:40,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:40,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580218148] [2022-11-25 23:27:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:27:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:27:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:40,241 INFO L87 Difference]: Start difference. First operand 1691 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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) [2022-11-25 23:27:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:40,532 INFO L93 Difference]: Finished difference Result 2110 states and 2415 transitions. [2022-11-25 23:27:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:27:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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 [2022-11-25 23:27:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:40,541 INFO L225 Difference]: With dead ends: 2110 [2022-11-25 23:27:40,541 INFO L226 Difference]: Without dead ends: 2110 [2022-11-25 23:27:40,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:40,542 INFO L413 NwaCegarLoop]: 1596 mSDtfsCounter, 455 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:40,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2988 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:27:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-11-25 23:27:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1737. [2022-11-25 23:27:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1033 states have (on average 1.9293320425943852) internal successors, (1993), 1728 states have internal predecessors, (1993), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2025 transitions. [2022-11-25 23:27:40,574 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2025 transitions. Word has length 50 [2022-11-25 23:27:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:40,574 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2025 transitions. [2022-11-25 23:27:40,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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) [2022-11-25 23:27:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2025 transitions. [2022-11-25 23:27:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:27:40,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:40,575 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] [2022-11-25 23:27:40,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:40,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:40,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-25 23:27:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:40,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953675462] [2022-11-25 23:27:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:40,790 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 [2022-11-25 23:27:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:40,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:40,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:41,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:27:41,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:41,223 INFO L350 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 [2022-11-25 23:27:41,232 INFO L350 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 [2022-11-25 23:27:41,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:27:41,785 INFO L350 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 12 treesize of output 14 [2022-11-25 23:27:41,802 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:27:41,803 INFO L350 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 [2022-11-25 23:27:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:41,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:41,834 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953675462] [2022-11-25 23:27:41,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953675462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:41,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:41,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516250198] [2022-11-25 23:27:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:41,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:41,837 INFO L87 Difference]: Start difference. First operand 1737 states and 2025 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:46,862 INFO L93 Difference]: Finished difference Result 1706 states and 1948 transitions. [2022-11-25 23:27:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-25 23:27:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:46,869 INFO L225 Difference]: With dead ends: 1706 [2022-11-25 23:27:46,869 INFO L226 Difference]: Without dead ends: 1706 [2022-11-25 23:27:46,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:46,870 INFO L413 NwaCegarLoop]: 744 mSDtfsCounter, 1047 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:46,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1214 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 23:27:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-11-25 23:27:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1487. [2022-11-25 23:27:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 867 states have (on average 1.8362168396770473) internal successors, (1592), 1478 states have internal predecessors, (1592), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1624 transitions. [2022-11-25 23:27:46,896 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1624 transitions. Word has length 53 [2022-11-25 23:27:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:46,896 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 1624 transitions. [2022-11-25 23:27:46,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1624 transitions. [2022-11-25 23:27:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:27:46,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:46,897 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] [2022-11-25 23:27:46,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 23:27:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:47,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-25 23:27:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:47,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654596972] [2022-11-25 23:27:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:47,114 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 [2022-11-25 23:27:47,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:47,116 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:47,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:47,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:27:47,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:47,423 INFO L350 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 [2022-11-25 23:27:47,438 INFO L350 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 [2022-11-25 23:27:47,473 INFO L350 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 [2022-11-25 23:27:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:47,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:47,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654596972] [2022-11-25 23:27:47,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654596972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:47,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:47,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:27:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642551331] [2022-11-25 23:27:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:27:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:27:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:47,490 INFO L87 Difference]: Start difference. First operand 1487 states and 1624 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) [2022-11-25 23:27:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:52,605 INFO L93 Difference]: Finished difference Result 1486 states and 1623 transitions. [2022-11-25 23:27:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:27:52,605 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 [2022-11-25 23:27:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:52,613 INFO L225 Difference]: With dead ends: 1486 [2022-11-25 23:27:52,613 INFO L226 Difference]: Without dead ends: 1486 [2022-11-25 23:27:52,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:27:52,614 INFO L413 NwaCegarLoop]: 1438 mSDtfsCounter, 4 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3614 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:52,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3614 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 23:27:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-11-25 23:27:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2022-11-25 23:27:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 867 states have (on average 1.8350634371395618) internal successors, (1591), 1477 states have internal predecessors, (1591), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:27:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1623 transitions. [2022-11-25 23:27:52,652 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1623 transitions. Word has length 58 [2022-11-25 23:27:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:52,653 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 1623 transitions. [2022-11-25 23:27:52,654 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) [2022-11-25 23:27:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1623 transitions. [2022-11-25 23:27:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:27:52,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:52,657 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] [2022-11-25 23:27:52,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:52,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:27:52,872 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:27:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-25 23:27:52,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:27:52,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127145150] [2022-11-25 23:27:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:52,874 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 [2022-11-25 23:27:52,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:27:52,876 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:27:52,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:27:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:53,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:27:53,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:27:53,278 INFO L350 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 [2022-11-25 23:27:53,313 INFO L350 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 [2022-11-25 23:27:53,325 INFO L350 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 [2022-11-25 23:27:53,390 INFO L350 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 [2022-11-25 23:27:53,402 INFO L350 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 19 treesize of output 7 [2022-11-25 23:27:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:53,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:27:53,427 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:27:53,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127145150] [2022-11-25 23:27:53,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127145150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:53,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:53,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:27:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945626709] [2022-11-25 23:27:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:27:53,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:27:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:27:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:53,429 INFO L87 Difference]: Start difference. First operand 1486 states and 1623 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) [2022-11-25 23:28:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:00,715 INFO L93 Difference]: Finished difference Result 1485 states and 1622 transitions. [2022-11-25 23:28:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:28:00,716 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 [2022-11-25 23:28:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:00,721 INFO L225 Difference]: With dead ends: 1485 [2022-11-25 23:28:00,721 INFO L226 Difference]: Without dead ends: 1485 [2022-11-25 23:28:00,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:28:00,723 INFO L413 NwaCegarLoop]: 1438 mSDtfsCounter, 2 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:00,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3665 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-25 23:28:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-11-25 23:28:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2022-11-25 23:28:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 866 states have (on average 1.836027713625866) internal successors, (1590), 1476 states have internal predecessors, (1590), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:28:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1622 transitions. [2022-11-25 23:28:00,756 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1622 transitions. Word has length 58 [2022-11-25 23:28:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:00,756 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 1622 transitions. [2022-11-25 23:28:00,756 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) [2022-11-25 23:28:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1622 transitions. [2022-11-25 23:28:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 23:28:00,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:00,759 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, 1] [2022-11-25 23:28:00,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:28:00,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:28:00,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:28:00,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1437209854, now seen corresponding path program 1 times [2022-11-25 23:28:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:28:00,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048229207] [2022-11-25 23:28:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:00,978 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 [2022-11-25 23:28:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:28:00,979 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:28:00,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:28:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:01,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:28:01,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:01,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:28:01,367 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:28:01,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048229207] [2022-11-25 23:28:01,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048229207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:01,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:01,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:28:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923991557] [2022-11-25 23:28:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:01,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:28:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:01,372 INFO L87 Difference]: Start difference. First operand 1485 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-11-25 23:28:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:01,463 INFO L93 Difference]: Finished difference Result 1488 states and 1627 transitions. [2022-11-25 23:28:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:01,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2022-11-25 23:28:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:01,470 INFO L225 Difference]: With dead ends: 1488 [2022-11-25 23:28:01,470 INFO L226 Difference]: Without dead ends: 1488 [2022-11-25 23:28:01,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:28:01,472 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 2 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:01,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:28:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-11-25 23:28:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-11-25 23:28:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 868 states have (on average 1.8352534562211982) internal successors, (1593), 1479 states have internal predecessors, (1593), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:28:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1627 transitions. [2022-11-25 23:28:01,510 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1627 transitions. Word has length 66 [2022-11-25 23:28:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:01,511 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1627 transitions. [2022-11-25 23:28:01,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-11-25 23:28:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1627 transitions. [2022-11-25 23:28:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 23:28:01,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:01,512 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, 1, 1] [2022-11-25 23:28:01,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:28:01,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:28:01,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:28:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1929088695, now seen corresponding path program 1 times [2022-11-25 23:28:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:28:01,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710097253] [2022-11-25 23:28:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:01,731 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 [2022-11-25 23:28:01,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:28:01,733 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:28:01,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 [2022-11-25 23:28:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:02,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:28:02,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:02,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:02,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:28:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710097253] [2022-11-25 23:28:02,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710097253] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1698182310] [2022-11-25 23:28:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:28:02,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:28:02,311 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:28:02,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-25 23:28:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:02,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:28:02,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:03,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:03,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1698182310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:03,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120335743] [2022-11-25 23:28:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:03,080 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:03,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 23:28:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:03,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:28:03,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:03,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:03,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120335743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:03,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:28:03,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-25 23:28:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10590316] [2022-11-25 23:28:03,548 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:03,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:28:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:28:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:28:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:28:03,550 INFO L87 Difference]: Start difference. First operand 1488 states and 1627 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2022-11-25 23:28:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:03,900 INFO L93 Difference]: Finished difference Result 1500 states and 1645 transitions. [2022-11-25 23:28:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:28:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 67 [2022-11-25 23:28:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:03,906 INFO L225 Difference]: With dead ends: 1500 [2022-11-25 23:28:03,906 INFO L226 Difference]: Without dead ends: 1500 [2022-11-25 23:28:03,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:28:03,914 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 12 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5731 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:03,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5731 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:28:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2022-11-25 23:28:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1498. [2022-11-25 23:28:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 877 states have (on average 1.8335233751425313) internal successors, (1608), 1488 states have internal predecessors, (1608), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:28:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1642 transitions. [2022-11-25 23:28:03,949 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1642 transitions. Word has length 67 [2022-11-25 23:28:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:03,950 INFO L495 AbstractCegarLoop]: Abstraction has 1498 states and 1642 transitions. [2022-11-25 23:28:03,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) [2022-11-25 23:28:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1642 transitions. [2022-11-25 23:28:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 23:28:03,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:03,951 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, 1, 1] [2022-11-25 23:28:03,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:04,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:04,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:04,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:28:04,571 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:28:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash -619234498, now seen corresponding path program 2 times [2022-11-25 23:28:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:28:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945997556] [2022-11-25 23:28:04,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:28:04,573 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 [2022-11-25 23:28:04,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:28:04,574 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:28:04,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 23:28:05,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:28:05,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:05,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:28:05,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:05,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:05,645 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:28:05,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945997556] [2022-11-25 23:28:05,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945997556] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:05,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064979652] [2022-11-25 23:28:05,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:28:05,646 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:28:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:28:05,652 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:28:05,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-25 23:28:07,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:28:07,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:28:07,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:07,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:07,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2064979652] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:07,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420067888] [2022-11-25 23:28:07,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:28:07,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:07,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:07,428 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:07,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 23:28:18,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:28:18,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:18,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:28:18,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:19,056 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:28:19,057 INFO L350 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 [2022-11-25 23:28:19,106 INFO L350 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 13 treesize of output 9 [2022-11-25 23:28:19,757 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:28:19,758 INFO L350 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 37 [2022-11-25 23:28:19,889 INFO L350 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 [2022-11-25 23:28:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:19,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:20,130 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 23:28:20,130 INFO L350 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 [2022-11-25 23:28:20,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-25 23:28:20,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420067888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:20,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 23:28:20,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-25 23:28:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593852238] [2022-11-25 23:28:20,146 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 23:28:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:28:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 23:28:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-25 23:28:20,149 INFO L87 Difference]: Start difference. First operand 1498 states and 1642 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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) [2022-11-25 23:28:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:41,877 INFO L93 Difference]: Finished difference Result 1571 states and 1681 transitions. [2022-11-25 23:28:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 23:28:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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 70 [2022-11-25 23:28:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:41,883 INFO L225 Difference]: With dead ends: 1571 [2022-11-25 23:28:41,884 INFO L226 Difference]: Without dead ends: 1567 [2022-11-25 23:28:41,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-11-25 23:28:41,886 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 2063 mSDsluCounter, 9940 mSDsCounter, 0 mSdLazyCounter, 7884 mSolverCounterSat, 91 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 10860 SdHoareTripleChecker+Invalid, 7980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 7884 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:41,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 10860 Invalid, 7980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [91 Valid, 7884 Invalid, 5 Unknown, 0 Unchecked, 19.6s Time] [2022-11-25 23:28:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-11-25 23:28:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1506. [2022-11-25 23:28:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 886 states have (on average 1.827313769751693) internal successors, (1619), 1496 states have internal predecessors, (1619), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:28:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1653 transitions. [2022-11-25 23:28:41,947 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1653 transitions. Word has length 70 [2022-11-25 23:28:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:41,948 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 1653 transitions. [2022-11-25 23:28:41,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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) [2022-11-25 23:28:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1653 transitions. [2022-11-25 23:28:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 23:28:41,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:41,957 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, 1, 1] [2022-11-25 23:28:41,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:42,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:42,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:42,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:42,576 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:28:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1151162527, now seen corresponding path program 1 times [2022-11-25 23:28:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:28:42,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312151189] [2022-11-25 23:28:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:42,577 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 [2022-11-25 23:28:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:28:42,579 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:28:42,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 23:28:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:43,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:28:43,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:43,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:44,059 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:28:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312151189] [2022-11-25 23:28:44,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312151189] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [597634260] [2022-11-25 23:28:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:44,060 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:28:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:28:44,061 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:28:44,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-25 23:28:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:44,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:28:44,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:44,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [597634260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:45,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076270086] [2022-11-25 23:28:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:45,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:45,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:45,203 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:45,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 23:28:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:45,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:28:45,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:45,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:47,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076270086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:47,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:28:47,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-25 23:28:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918376898] [2022-11-25 23:28:47,059 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:47,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 23:28:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:28:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 23:28:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:28:47,062 INFO L87 Difference]: Start difference. First operand 1506 states and 1653 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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) [2022-11-25 23:28:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:51,931 INFO L93 Difference]: Finished difference Result 1548 states and 1719 transitions. [2022-11-25 23:28:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 23:28:51,932 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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 76 [2022-11-25 23:28:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:51,936 INFO L225 Difference]: With dead ends: 1548 [2022-11-25 23:28:51,937 INFO L226 Difference]: Without dead ends: 1542 [2022-11-25 23:28:51,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-25 23:28:51,939 INFO L413 NwaCegarLoop]: 1443 mSDtfsCounter, 63 mSDsluCounter, 18693 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 20136 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:51,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 20136 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 23:28:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-11-25 23:28:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1524. [2022-11-25 23:28:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 904 states have (on average 1.8163716814159292) internal successors, (1642), 1514 states have internal predecessors, (1642), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:28:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1676 transitions. [2022-11-25 23:28:51,965 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1676 transitions. Word has length 76 [2022-11-25 23:28:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:51,965 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1676 transitions. [2022-11-25 23:28:51,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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) [2022-11-25 23:28:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1676 transitions. [2022-11-25 23:28:51,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 23:28:51,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:51,967 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, 1, 1] [2022-11-25 23:28:51,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:52,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:52,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:52,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:28:52,580 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:28:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1981086559, now seen corresponding path program 2 times [2022-11-25 23:28:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:28:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999659281] [2022-11-25 23:28:52,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:28:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:28:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:28:52,584 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:28:52,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-25 23:28:53,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:28:53,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:53,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:28:53,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:54,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:59,071 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:28:59,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999659281] [2022-11-25 23:28:59,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999659281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:59,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1890651552] [2022-11-25 23:28:59,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:28:59,073 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:28:59,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:28:59,075 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:28:59,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-25 23:29:00,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:29:00,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:29:00,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:29:00,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:29:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:29:01,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:29:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:29:02,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1890651552] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:29:02,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944868632] [2022-11-25 23:29:02,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:29:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:29:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:29:02,888 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:29:02,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-25 23:29:09,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:29:09,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:29:10,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 23:29:10,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:29:10,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:29:10,380 INFO L350 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 [2022-11-25 23:29:10,392 INFO L350 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 [2022-11-25 23:29:10,558 INFO L350 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 13 treesize of output 9 [2022-11-25 23:29:10,575 INFO L350 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 [2022-11-25 23:29:11,093 INFO L350 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 [2022-11-25 23:29:11,099 INFO L350 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 [2022-11-25 23:29:11,551 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-25 23:29:11,569 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376)))) is different from true [2022-11-25 23:29:11,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:29:12,009 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2384) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383)))) is different from true [2022-11-25 23:29:12,026 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386)))) is different from true [2022-11-25 23:29:12,041 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:29:12,057 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:29:12,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2397))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2398)))) is different from true [2022-11-25 23:29:12,827 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401)))) is different from true [2022-11-25 23:29:13,037 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-25 23:29:13,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407)))) is different from true [2022-11-25 23:29:13,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413)))) is different from true [2022-11-25 23:29:13,546 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:29:13,546 INFO L350 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 46 treesize of output 45 [2022-11-25 23:29:13,554 INFO L350 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 22 treesize of output 24 [2022-11-25 23:29:13,815 INFO L350 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 [2022-11-25 23:29:13,824 INFO L350 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 19 treesize of output 7 [2022-11-25 23:29:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 198 not checked. [2022-11-25 23:29:13,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:29:15,041 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2022-11-25 23:29:15,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944868632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:29:15,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 23:29:15,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 21] total 70 [2022-11-25 23:29:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674120857] [2022-11-25 23:29:15,049 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 23:29:15,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-25 23:29:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:29:15,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-25 23:29:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2833, Unknown=37, NotChecked=1664, Total=5256 [2022-11-25 23:29:15,053 INFO L87 Difference]: Start difference. First operand 1524 states and 1676 transitions. Second operand has 70 states, 69 states have (on average 2.710144927536232) internal successors, (187), 70 states have internal predecessors, (187), 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) [2022-11-25 23:30:12,395 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2384) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2397))) (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (exists ((v_ArrVal_2398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2398))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401))) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2385) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376))) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2386))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371))) (exists ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2407))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-25 23:31:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:38,706 INFO L93 Difference]: Finished difference Result 2694 states and 3014 transitions. [2022-11-25 23:31:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-11-25 23:31:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.710144927536232) internal successors, (187), 70 states have internal predecessors, (187), 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 88 [2022-11-25 23:31:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:38,713 INFO L225 Difference]: With dead ends: 2694 [2022-11-25 23:31:38,713 INFO L226 Difference]: Without dead ends: 2676 [2022-11-25 23:31:38,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 350 SyntacticMatches, 21 SemanticMatches, 180 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 7402 ImplicationChecksByTransitivity, 82.3s TimeCoverageRelationStatistics Valid=5905, Invalid=21370, Unknown=837, NotChecked=4830, Total=32942 [2022-11-25 23:31:38,726 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 3045 mSDsluCounter, 26887 mSDsCounter, 0 mSdLazyCounter, 24483 mSolverCounterSat, 259 mSolverCounterUnsat, 1095 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 27830 SdHoareTripleChecker+Invalid, 45857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 24483 IncrementalHoareTripleChecker+Invalid, 1095 IncrementalHoareTripleChecker+Unknown, 20020 IncrementalHoareTripleChecker+Unchecked, 68.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:38,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3124 Valid, 27830 Invalid, 45857 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [259 Valid, 24483 Invalid, 1095 Unknown, 20020 Unchecked, 68.6s Time] [2022-11-25 23:31:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2022-11-25 23:31:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1610. [2022-11-25 23:31:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 990 states have (on average 1.7585858585858587) internal successors, (1741), 1599 states have internal predecessors, (1741), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:31:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1775 transitions. [2022-11-25 23:31:38,794 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1775 transitions. Word has length 88 [2022-11-25 23:31:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:38,794 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 1775 transitions. [2022-11-25 23:31:38,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.710144927536232) internal successors, (187), 70 states have internal predecessors, (187), 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) [2022-11-25 23:31:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1775 transitions. [2022-11-25 23:31:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 23:31:38,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:38,797 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] [2022-11-25 23:31:38,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-25 23:31:39,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-25 23:31:39,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-25 23:31:39,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:39,412 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:31:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1867051913, now seen corresponding path program 1 times [2022-11-25 23:31:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:31:39,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085826757] [2022-11-25 23:31:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:39,413 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 [2022-11-25 23:31:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:31:39,423 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:31:39,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 23:31:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:40,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 23:31:40,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:40,571 INFO L350 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 [2022-11-25 23:31:40,765 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:31:40,766 INFO L350 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 [2022-11-25 23:31:40,810 INFO L350 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 13 treesize of output 9 [2022-11-25 23:31:40,945 INFO L350 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 [2022-11-25 23:31:41,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2828) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:31:41,705 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2840) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:31:42,112 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850)))) is different from true [2022-11-25 23:31:42,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:31:42,971 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:31:42,972 INFO L350 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 37 [2022-11-25 23:31:43,130 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:31:43,131 INFO L350 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 37 [2022-11-25 23:31:43,163 INFO L350 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 [2022-11-25 23:31:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-25 23:31:43,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:43,294 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2869) |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 [2022-11-25 23:31:43,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (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_2869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:31:43,757 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2869 (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~mem33#1.base| v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 23:31:43,761 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:31:43,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085826757] [2022-11-25 23:31:43,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085826757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:43,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1542156577] [2022-11-25 23:31:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:43,762 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:31:43,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:31:43,763 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:31:43,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-25 23:31:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:48,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 23:31:48,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:48,542 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:31:48,543 INFO L350 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 14 treesize of output 20 [2022-11-25 23:31:48,915 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-25 23:31:48,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:31:48,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-25 23:31:49,280 INFO L350 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 34 treesize of output 16 [2022-11-25 23:31:53,323 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:31:53,323 INFO L350 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 46 treesize of output 45 [2022-11-25 23:31:53,597 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:31:53,597 INFO L350 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 46 treesize of output 45 [2022-11-25 23:31:53,648 INFO L350 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 43 treesize of output 19 [2022-11-25 23:31:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 23:31:53,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:54,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3322 (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_3322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 23:31:54,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3322 (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~mem33#1.base| v_ArrVal_3368))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:31:54,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1542156577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:54,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325497370] [2022-11-25 23:31:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:54,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:54,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:54,592 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:31:54,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-25 23:31:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:55,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 23:31:55,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:55,535 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:31:55,535 INFO L350 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 [2022-11-25 23:31:55,587 INFO L350 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 13 treesize of output 9 [2022-11-25 23:31:59,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:31:59,078 INFO L350 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 37 [2022-11-25 23:31:59,310 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:31:59,310 INFO L350 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 37 [2022-11-25 23:31:59,331 INFO L350 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 [2022-11-25 23:31:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 23:31:59,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:59,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3773) |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 [2022-11-25 23:31:59,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (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_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:31:59,761 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 23:31:59,762 INFO L350 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 [2022-11-25 23:31:59,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3819 (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~mem33#1.base| v_ArrVal_3819))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3773)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2022-11-25 23:31:59,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325497370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:59,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:31:59,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 12] total 32 [2022-11-25 23:31:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83631209] [2022-11-25 23:31:59,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:31:59,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 23:31:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:31:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 23:31:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=775, Unknown=47, NotChecked=828, Total=1806 [2022-11-25 23:31:59,782 INFO L87 Difference]: Start difference. First operand 1610 states and 1775 transitions. Second operand has 33 states, 29 states have (on average 6.517241379310345) internal successors, (189), 32 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:32:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:41,555 INFO L93 Difference]: Finished difference Result 3010 states and 3234 transitions. [2022-11-25 23:32:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 23:32:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 6.517241379310345) internal successors, (189), 32 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 113 [2022-11-25 23:32:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:41,561 INFO L225 Difference]: With dead ends: 3010 [2022-11-25 23:32:41,562 INFO L226 Difference]: Without dead ends: 3010 [2022-11-25 23:32:41,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 189 SyntacticMatches, 129 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=402, Invalid=2422, Unknown=86, NotChecked=1380, Total=4290 [2022-11-25 23:32:41,563 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 5486 mSDsluCounter, 9989 mSDsCounter, 0 mSdLazyCounter, 11040 mSolverCounterSat, 154 mSolverCounterUnsat, 3683 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5506 SdHoareTripleChecker+Valid, 10899 SdHoareTripleChecker+Invalid, 25424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 11040 IncrementalHoareTripleChecker+Invalid, 3683 IncrementalHoareTripleChecker+Unknown, 10547 IncrementalHoareTripleChecker+Unchecked, 40.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:41,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5506 Valid, 10899 Invalid, 25424 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [154 Valid, 11040 Invalid, 3683 Unknown, 10547 Unchecked, 40.0s Time] [2022-11-25 23:32:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2022-11-25 23:32:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1609. [2022-11-25 23:32:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 990 states have (on average 1.7575757575757576) internal successors, (1740), 1598 states have internal predecessors, (1740), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:32:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1774 transitions. [2022-11-25 23:32:41,593 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1774 transitions. Word has length 113 [2022-11-25 23:32:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:41,593 INFO L495 AbstractCegarLoop]: Abstraction has 1609 states and 1774 transitions. [2022-11-25 23:32:41,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 6.517241379310345) internal successors, (189), 32 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:32:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1774 transitions. [2022-11-25 23:32:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 23:32:41,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:41,595 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] [2022-11-25 23:32:41,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-25 23:32:41,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-25 23:32:42,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-11-25 23:32:42,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:32:42,214 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:32:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1867051912, now seen corresponding path program 1 times [2022-11-25 23:32:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:32:42,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848904278] [2022-11-25 23:32:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:42,215 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 [2022-11-25 23:32:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:32:42,216 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:32:42,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-25 23:32:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:43,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 23:32:43,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:32:43,287 INFO L350 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 [2022-11-25 23:32:43,472 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:32:43,473 INFO L350 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 [2022-11-25 23:32:43,481 INFO L350 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 [2022-11-25 23:32:43,510 INFO L350 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 13 treesize of output 9 [2022-11-25 23:32:43,524 INFO L350 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 [2022-11-25 23:32:43,668 INFO L350 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 [2022-11-25 23:32:43,674 INFO L350 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 [2022-11-25 23:32:43,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184)))) is different from true [2022-11-25 23:32:43,774 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186)))) is different from true [2022-11-25 23:32:43,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-11-25 23:32:43,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193)))) is different from true [2022-11-25 23:32:43,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194)))) is different from true [2022-11-25 23:32:43,877 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:43,890 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198)))) is different from true [2022-11-25 23:32:43,939 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2022-11-25 23:32:43,952 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204)))) is different from true [2022-11-25 23:32:44,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:44,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2022-11-25 23:32:44,060 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215)))) is different from true [2022-11-25 23:32:44,072 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:44,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-25 23:32:44,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220)))) is different from true [2022-11-25 23:32:44,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225)))) is different from true [2022-11-25 23:32:44,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:44,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228)))) is different from true [2022-11-25 23:32:44,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231)))) is different from true [2022-11-25 23:32:44,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233)))) is different from true [2022-11-25 23:32:44,196 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234)))) is different from true [2022-11-25 23:32:44,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237)))) is different from true [2022-11-25 23:32:44,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:32:44,231 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240))) (exists ((v_ArrVal_4241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4241) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:32:44,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4242))) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:44,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:44,266 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246))) (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247)))) is different from true [2022-11-25 23:32:44,278 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248)))) is different from true [2022-11-25 23:32:44,289 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:32:44,301 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:32:44,316 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-11-25 23:32:44,358 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:32:44,438 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265)))) is different from true [2022-11-25 23:32:44,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4266) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267)))) is different from true [2022-11-25 23:32:44,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268)))) is different from true [2022-11-25 23:32:44,560 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:32:44,560 INFO L350 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 46 treesize of output 45 [2022-11-25 23:32:44,575 INFO L350 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 22 treesize of output 24 [2022-11-25 23:32:44,705 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:32:44,721 INFO L350 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 46 treesize of output 45 [2022-11-25 23:32:44,727 INFO L350 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 22 treesize of output 24 [2022-11-25 23:32:44,758 INFO L350 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 19 treesize of output 7 [2022-11-25 23:32:44,764 INFO L350 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 [2022-11-25 23:32:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 945 not checked. [2022-11-25 23:32:44,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:32:44,996 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:32:45,038 WARN L837 $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_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 23:32:46,117 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4364))) (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~mem33#1.base| v_ArrVal_4365) .cse0 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4365) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 23:32:46,127 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:32:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848904278] [2022-11-25 23:32:46,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848904278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:32:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [256913299] [2022-11-25 23:32:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:32:46,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:32:46,130 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:32:46,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-25 23:34:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:49,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 23:34:49,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:49,206 INFO L350 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 [2022-11-25 23:34:49,315 INFO L350 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 [2022-11-25 23:34:49,331 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:34:49,331 INFO L350 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 [2022-11-25 23:34:49,341 INFO L350 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 13 treesize of output 9 [2022-11-25 23:34:49,353 INFO L350 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 [2022-11-25 23:34:49,412 INFO L350 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 [2022-11-25 23:34:49,423 INFO L350 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 [2022-11-25 23:34:49,482 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:34:49,496 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733)))) is different from true [2022-11-25 23:34:49,507 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,519 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:34:49,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740)))) is different from true [2022-11-25 23:34:49,554 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742)))) is different from true [2022-11-25 23:34:49,566 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744)))) is different from true [2022-11-25 23:34:49,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747)))) is different from true [2022-11-25 23:34:49,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749)))) is different from true [2022-11-25 23:34:49,606 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:34:49,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-11-25 23:34:49,633 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,647 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,661 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,674 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-25 23:34:49,689 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,706 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764)))) is different from true [2022-11-25 23:34:49,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766)))) is different from true [2022-11-25 23:34:49,739 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768)))) is different from true [2022-11-25 23:34:49,756 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771)))) is different from true [2022-11-25 23:34:49,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774)))) is different from true [2022-11-25 23:34:49,805 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777)))) is different from true [2022-11-25 23:34:49,820 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778)))) is different from true [2022-11-25 23:34:49,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780)))) is different from true [2022-11-25 23:34:49,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782)))) is different from true [2022-11-25 23:34:49,863 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784)))) is different from true [2022-11-25 23:34:49,877 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787)))) is different from true [2022-11-25 23:34:49,891 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4789) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,906 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4790)))) is different from true [2022-11-25 23:34:49,920 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792))) (exists ((v_ArrVal_4793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4793)))) is different from true [2022-11-25 23:34:49,934 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794)))) is different from true [2022-11-25 23:34:49,948 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-25 23:34:49,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799)))) is different from true [2022-11-25 23:34:49,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4801) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:49,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4802))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803)))) is different from true [2022-11-25 23:34:50,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805)))) is different from true [2022-11-25 23:34:50,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:34:50,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4808) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809)))) is different from true [2022-11-25 23:34:50,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4811)))) is different from true [2022-11-25 23:34:50,076 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4812) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4813)))) is different from true [2022-11-25 23:34:50,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4814)))) is different from true [2022-11-25 23:34:50,102 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_4817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4817) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:50,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:34:50,150 INFO L350 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 46 treesize of output 45 [2022-11-25 23:34:50,163 INFO L350 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 22 treesize of output 24 [2022-11-25 23:34:50,237 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:34:50,238 INFO L350 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 46 treesize of output 45 [2022-11-25 23:34:50,248 INFO L350 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 22 treesize of output 24 [2022-11-25 23:34:50,277 INFO L350 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 19 treesize of output 7 [2022-11-25 23:34:50,283 INFO L350 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 [2022-11-25 23:34:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 23:34:50,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:34:50,360 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:34:50,406 WARN L837 $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_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 23:34:51,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4911))) (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~mem33#1.base| v_ArrVal_4910) .cse0 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4910) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 23:34:51,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [256913299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:34:51,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597495389] [2022-11-25 23:34:51,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:51,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:34:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:34:51,373 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:34:51,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 23:34:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:52,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 23:34:52,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:52,250 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:34:52,251 INFO L350 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 [2022-11-25 23:34:52,257 INFO L350 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 [2022-11-25 23:34:52,265 INFO L350 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 [2022-11-25 23:34:52,274 INFO L350 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 13 treesize of output 9 [2022-11-25 23:34:52,344 INFO L350 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 [2022-11-25 23:34:52,350 INFO L350 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 [2022-11-25 23:34:52,413 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-11-25 23:34:52,426 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278)))) is different from true [2022-11-25 23:34:52,439 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-25 23:34:52,453 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282)))) is different from true [2022-11-25 23:34:52,500 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285)))) is different from true [2022-11-25 23:34:52,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:34:52,555 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291)))) is different from true [2022-11-25 23:34:52,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-11-25 23:34:52,579 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295)))) is different from true [2022-11-25 23:34:52,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297)))) is different from true [2022-11-25 23:34:52,603 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299)))) is different from true [2022-11-25 23:34:52,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-11-25 23:34:52,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:52,637 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32)))) is different from true [2022-11-25 23:34:52,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-25 23:34:52,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309)))) is different from true [2022-11-25 23:34:52,677 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:52,694 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313)))) is different from true [2022-11-25 23:34:52,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:52,724 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:52,738 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-11-25 23:34:52,752 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322)))) is different from true [2022-11-25 23:34:52,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:52,780 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326)))) is different from true [2022-11-25 23:34:52,794 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:34:52,808 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330)))) is different from true [2022-11-25 23:34:52,821 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 23:34:52,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-11-25 23:34:52,863 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335)))) is different from true [2022-11-25 23:34:52,874 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337)))) is different from true [2022-11-25 23:34:52,886 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340)))) is different from true [2022-11-25 23:34:52,898 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5341))) (exists ((v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5342)))) is different from true [2022-11-25 23:34:52,909 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5344))) (exists ((v_ArrVal_5343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5343)))) is different from true [2022-11-25 23:34:52,921 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5345) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5346)))) is different from true [2022-11-25 23:34:52,940 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5347))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348)))) is different from true [2022-11-25 23:34:52,958 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350)))) is different from true [2022-11-25 23:34:52,973 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352)))) is different from true [2022-11-25 23:34:52,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354)))) is different from true [2022-11-25 23:34:53,002 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356)))) is different from true [2022-11-25 23:34:53,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5358)))) is different from true [2022-11-25 23:34:53,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5359) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360)))) is different from true [2022-11-25 23:34:53,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5362)))) is different from true [2022-11-25 23:34:53,097 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:34:53,097 INFO L350 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 46 treesize of output 45 [2022-11-25 23:34:53,105 INFO L350 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 22 treesize of output 24 [2022-11-25 23:34:53,185 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:34:53,186 INFO L350 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 46 treesize of output 45 [2022-11-25 23:34:53,192 INFO L350 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 22 treesize of output 24 [2022-11-25 23:34:53,225 INFO L350 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 19 treesize of output 7 [2022-11-25 23:34:53,230 INFO L350 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 [2022-11-25 23:34:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-11-25 23:34:53,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:34:53,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 23:34:53,342 WARN L837 $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_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 23:34:54,355 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5456))) (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~mem33#1.base| v_ArrVal_5455) .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5455) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 23:34:54,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597495389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:34:54,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:34:54,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 52, 52] total 131 [2022-11-25 23:34:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421953183] [2022-11-25 23:34:54,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:34:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-11-25 23:34:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:34:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-11-25 23:34:54,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=250, Unknown=137, NotChecked=19630, Total=20306 [2022-11-25 23:34:54,369 INFO L87 Difference]: Start difference. First operand 1609 states and 1774 transitions. Second operand has 132 states, 130 states have (on average 1.7461538461538462) internal successors, (227), 132 states have internal predecessors, (227), 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) [2022-11-25 23:34:55,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_arrayElimCell_44 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_44) (_ bv44 32))) (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-11-25 23:35:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:10,229 INFO L93 Difference]: Finished difference Result 1661 states and 1781 transitions. [2022-11-25 23:35:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:35:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 130 states have (on average 1.7461538461538462) internal successors, (227), 132 states have internal predecessors, (227), 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 113 [2022-11-25 23:35:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:10,233 INFO L225 Difference]: With dead ends: 1661 [2022-11-25 23:35:10,233 INFO L226 Difference]: Without dead ends: 1661 [2022-11-25 23:35:10,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 201 SyntacticMatches, 17 SemanticMatches, 150 ConstructedPredicates, 131 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=354, Invalid=445, Unknown=145, NotChecked=22008, Total=22952 [2022-11-25 23:35:10,235 INFO L413 NwaCegarLoop]: 928 mSDtfsCounter, 2000 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 4900 mSolverCounterSat, 27 mSolverCounterUnsat, 556 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 179947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4900 IncrementalHoareTripleChecker+Invalid, 556 IncrementalHoareTripleChecker+Unknown, 174464 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:10,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 4238 Invalid, 179947 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 4900 Invalid, 556 Unknown, 174464 Unchecked, 14.9s Time] [2022-11-25 23:35:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-11-25 23:35:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1608. [2022-11-25 23:35:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 990 states have (on average 1.7565656565656567) internal successors, (1739), 1597 states have internal predecessors, (1739), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 23:35:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1773 transitions. [2022-11-25 23:35:10,259 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1773 transitions. Word has length 113 [2022-11-25 23:35:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:10,259 INFO L495 AbstractCegarLoop]: Abstraction has 1608 states and 1773 transitions. [2022-11-25 23:35:10,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 130 states have (on average 1.7461538461538462) internal successors, (227), 132 states have internal predecessors, (227), 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) [2022-11-25 23:35:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1773 transitions. [2022-11-25 23:35:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 23:35:10,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:10,261 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, 1, 1] [2022-11-25 23:35:10,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:10,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:10,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:10,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:35:10,875 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-11-25 23:35:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1516777915, now seen corresponding path program 1 times [2022-11-25 23:35:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:35:10,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716653116] [2022-11-25 23:35:10,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:10,877 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 [2022-11-25 23:35:10,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:35:10,878 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -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) [2022-11-25 23:35:10,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-25 23:35:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:11,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-25 23:35:11,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:11,971 INFO L350 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 [2022-11-25 23:35:12,108 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:35:12,109 INFO L350 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 [2022-11-25 23:35:12,164 INFO L350 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 13 treesize of output 9 [2022-11-25 23:35:12,270 INFO L350 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 [2022-11-25 23:35:12,445 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 23:35:14,050 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:35:14,051 INFO L350 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 37 [2022-11-25 23:35:14,160 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:35:14,160 INFO L350 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 37 [2022-11-25 23:35:14,258 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:35:14,258 INFO L350 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 37 [2022-11-25 23:35:14,282 INFO L350 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 [2022-11-25 23:35:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-25 23:35:14,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:14,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5879) |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 [2022-11-25 23:35:14,411 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5879 (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_5879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-25 23:35:14,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (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~mem35#1.base| v_ArrVal_5878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 23:35:14,442 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (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_5878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:35:14,751 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (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~mem33#1.base| v_ArrVal_5925))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5878)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:35:14,755 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:35:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716653116] [2022-11-25 23:35:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716653116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836213732] [2022-11-25 23:35:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:14,756 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:35:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:35:14,759 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:35:14,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5711d30-847a-4d93-b18c-872cec9da6ee/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-25 23:35:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:41,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 23:35:41,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:41,356 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:35:41,356 INFO L350 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 14 treesize of output 20 [2022-11-25 23:35:41,867 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-25 23:35:41,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:35:41,949 INFO L350 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 [2022-11-25 23:35:41,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-25 23:35:42,146 INFO L350 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 43 treesize of output 19 [2022-11-25 23:35:42,261 INFO L350 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 [2022-11-25 23:35:45,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:35:46,281 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:35:46,282 INFO L350 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 49 [2022-11-25 23:35:46,312 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:35:46,313 INFO L350 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 37 treesize of output 29 [2022-11-25 23:35:46,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2022-11-25 23:35:46,392 INFO L350 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 19 treesize of output 7 [2022-11-25 23:35:46,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:46,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:46,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:46,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:46,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-25 23:35:46,734 INFO L350 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 19 treesize of output 11 [2022-11-25 23:35:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 23:35:46,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:48,067 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:35:48,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4607 treesize of output 4099 [2022-11-25 23:35:48,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8828 treesize of output 6892 [2022-11-25 23:35:48,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31417 treesize of output 31269