./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS --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 a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- 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-8393723 [2022-11-19 08:25:35,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:25:35,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:25:35,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:25:35,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:25:35,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:25:35,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:25:35,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:25:35,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:25:35,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:25:35,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:25:35,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:25:35,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:25:35,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:25:35,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:25:35,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:25:35,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:25:35,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:25:35,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:25:35,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:25:35,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:25:35,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:25:35,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:25:35,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:25:35,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:25:35,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:25:35,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:25:35,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:25:35,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:25:35,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:25:35,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:25:35,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:25:35,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:25:35,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:25:35,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:25:35,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:25:35,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:25:35,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:25:35,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:25:35,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:25:35,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:25:35,099 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:25:35,135 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:25:35,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:25:35,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:25:35,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:25:35,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:25:35,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:25:35,145 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:25:35,145 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:25:35,145 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:25:35,145 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:25:35,146 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:25:35,147 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:25:35,147 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:25:35,147 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:25:35,147 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:25:35,147 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:25:35,148 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:25:35,148 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:25:35,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:25:35,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:25:35,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:25:35,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:25:35,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:25:35,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:25:35,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:25:35,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:25:35,152 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:25:35,152 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:25:35,152 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:25:35,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:25:35,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:25:35,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:25:35,153 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:25:35,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:25:35,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:25:35,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:25:35,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:25:35,154 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:25:35,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:25:35,155 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:25:35,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:25:35,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:25:35,155 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_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/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_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS 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 -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2022-11-19 08:25:35,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:25:35,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:25:35,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:25:35,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:25:35,498 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:25:35,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-19 08:25:35,559 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/056b6f664/064c64f8deb04c9497bcd4cf8e26dae9/FLAGfb2d7ae44 [2022-11-19 08:25:36,255 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:25:36,256 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-19 08:25:36,271 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/056b6f664/064c64f8deb04c9497bcd4cf8e26dae9/FLAGfb2d7ae44 [2022-11-19 08:25:36,576 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/056b6f664/064c64f8deb04c9497bcd4cf8e26dae9 [2022-11-19 08:25:36,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:25:36,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:25:36,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:25:36,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:25:36,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:25:36,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:25:36" (1/1) ... [2022-11-19 08:25:36,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c8841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:36, skipping insertion in model container [2022-11-19 08:25:36,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:25:36" (1/1) ... [2022-11-19 08:25:36,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:25:36,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:25:37,200 WARN L234 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_80596e3c-9e36-4bac-838d-d7687da9f83c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-19 08:25:37,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:25:37,324 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-19 08:25:37,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fe1188c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:37, skipping insertion in model container [2022-11-19 08:25:37,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:25:37,325 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-19 08:25:37,327 INFO L158 Benchmark]: Toolchain (without parser) took 743.56ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 91.4MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:25:37,328 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:25:37,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.75ms. Allocated memory is still 125.8MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 08:25:37,330 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.24ms. Allocated memory is still 81.8MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.75ms. Allocated memory is still 125.8MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS --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 a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- 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-8393723 [2022-11-19 08:25:39,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:25:39,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:25:39,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:25:39,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:25:39,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:25:39,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:25:39,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:25:39,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:25:39,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:25:39,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:25:39,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:25:39,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:25:39,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:25:39,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:25:39,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:25:39,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:25:39,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:25:39,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:25:39,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:25:39,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:25:39,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:25:39,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:25:39,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:25:39,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:25:39,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:25:39,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:25:39,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:25:39,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:25:39,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:25:39,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:25:39,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:25:39,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:25:39,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:25:39,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:25:39,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:25:39,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:25:39,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:25:39,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:25:39,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:25:39,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:25:39,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:25:39,475 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:25:39,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:25:39,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:25:39,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:25:39,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:25:39,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:25:39,481 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:25:39,481 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:25:39,481 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:25:39,481 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:25:39,482 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:25:39,482 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:25:39,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:25:39,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:25:39,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:25:39,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:25:39,485 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:25:39,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:25:39,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:25:39,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:25:39,485 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:25:39,486 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:25:39,486 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:25:39,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:25:39,486 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:25:39,487 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:25:39,487 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:25:39,487 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:25:39,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:25:39,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:25:39,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:25:39,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:25:39,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:25:39,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:25:39,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:25:39,489 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:25:39,489 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:25:39,489 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:25:39,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:25:39,489 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_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/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_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS 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 -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2022-11-19 08:25:39,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:25:39,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:25:39,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:25:39,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:25:39,890 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:25:39,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-19 08:25:39,965 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/e367173bf/0955878b254d47efa582940718d1a596/FLAGbc53dd4e5 [2022-11-19 08:25:40,546 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:25:40,547 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-11-19 08:25:40,560 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/e367173bf/0955878b254d47efa582940718d1a596/FLAGbc53dd4e5 [2022-11-19 08:25:40,795 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/data/e367173bf/0955878b254d47efa582940718d1a596 [2022-11-19 08:25:40,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:25:40,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:25:40,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:25:40,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:25:40,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:25:40,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:25:40" (1/1) ... [2022-11-19 08:25:40,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1830ccc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:40, skipping insertion in model container [2022-11-19 08:25:40,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:25:40" (1/1) ... [2022-11-19 08:25:40,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:25:40,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:25:41,410 WARN L234 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_80596e3c-9e36-4bac-838d-d7687da9f83c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-19 08:25:41,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:25:41,542 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-19 08:25:41,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:25:41,599 WARN L234 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_80596e3c-9e36-4bac-838d-d7687da9f83c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-19 08:25:41,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:25:41,650 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:25:41,713 WARN L234 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_80596e3c-9e36-4bac-838d-d7687da9f83c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2022-11-19 08:25:41,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:25:41,865 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:25:41,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41 WrapperNode [2022-11-19 08:25:41,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:25:41,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:25:41,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:25:41,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:25:41,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:41,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:41,988 INFO L138 Inliner]: procedures = 180, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 624 [2022-11-19 08:25:42,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:25:42,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:25:42,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:25:42,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:25:42,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,113 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:25:42,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:25:42,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:25:42,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:25:42,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (1/1) ... [2022-11-19 08:25:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:25:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:25:42,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:25:42,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-19 08:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 08:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:25:42,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-19 08:25:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-19 08:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:25:42,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:25:42,432 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:25:42,434 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:25:42,438 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-19 08:25:45,583 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:25:45,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:25:45,616 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-19 08:25:45,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:25:45 BoogieIcfgContainer [2022-11-19 08:25:45,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:25:45,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:25:45,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:25:45,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:25:45,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:25:40" (1/3) ... [2022-11-19 08:25:45,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e2d092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:25:45, skipping insertion in model container [2022-11-19 08:25:45,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:25:41" (2/3) ... [2022-11-19 08:25:45,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e2d092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:25:45, skipping insertion in model container [2022-11-19 08:25:45,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:25:45" (3/3) ... [2022-11-19 08:25:45,633 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2022-11-19 08:25:45,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:25:45,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2022-11-19 08:25:45,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:25:45,741 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;@3e5f28ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:25:45,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2022-11-19 08:25:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 667 states, 324 states have (on average 2.2314814814814814) internal successors, (723), 661 states have internal predecessors, (723), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:25:45,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:45,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:25:45,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-19 08:25:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:45,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903741797] [2022-11-19 08:25:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:45,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:25:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:45,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:45,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:45,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 08:25:45,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:45,978 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-19 08:25:45,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:45,979 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903741797] [2022-11-19 08:25:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903741797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:45,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:25:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398344057] [2022-11-19 08:25:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:45,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:25:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:46,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:25:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:25:46,033 INFO L87 Difference]: Start difference. First operand has 667 states, 324 states have (on average 2.2314814814814814) internal successors, (723), 661 states have internal predecessors, (723), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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-19 08:25:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:46,106 INFO L93 Difference]: Finished difference Result 658 states and 704 transitions. [2022-11-19 08:25:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:25:46,109 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-19 08:25:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:46,124 INFO L225 Difference]: With dead ends: 658 [2022-11-19 08:25:46,124 INFO L226 Difference]: Without dead ends: 656 [2022-11-19 08:25:46,126 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-19 08:25:46,129 INFO L413 NwaCegarLoop]: 704 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, 704 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-19 08:25:46,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:25:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-19 08:25:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-11-19 08:25:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 319 states have (on average 2.1191222570532915) internal successors, (676), 650 states have internal predecessors, (676), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 702 transitions. [2022-11-19 08:25:46,200 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 702 transitions. Word has length 5 [2022-11-19 08:25:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:46,200 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 702 transitions. [2022-11-19 08:25:46,201 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-19 08:25:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 702 transitions. [2022-11-19 08:25:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:25:46,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:46,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:25:46,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:25:46,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:46,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-19 08:25:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:46,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326582704] [2022-11-19 08:25:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:46,415 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-19 08:25:46,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:46,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:46,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:46,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:25:46,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:46,566 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-19 08:25:46,611 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-19 08:25:46,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:46,611 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:46,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326582704] [2022-11-19 08:25:46,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326582704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:46,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:46,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:25:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112391683] [2022-11-19 08:25:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:46,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:25:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:25:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:46,615 INFO L87 Difference]: Start difference. First operand 656 states and 702 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-19 08:25:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:48,217 INFO L93 Difference]: Finished difference Result 614 states and 661 transitions. [2022-11-19 08:25:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:25:48,220 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-19 08:25:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:48,223 INFO L225 Difference]: With dead ends: 614 [2022-11-19 08:25:48,223 INFO L226 Difference]: Without dead ends: 614 [2022-11-19 08:25:48,223 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-19 08:25:48,224 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 594 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:48,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 349 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:25:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-19 08:25:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 607. [2022-11-19 08:25:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 319 states have (on average 1.9655172413793103) internal successors, (627), 601 states have internal predecessors, (627), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 653 transitions. [2022-11-19 08:25:48,268 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 653 transitions. Word has length 5 [2022-11-19 08:25:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:48,268 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 653 transitions. [2022-11-19 08:25:48,268 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-19 08:25:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 653 transitions. [2022-11-19 08:25:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:25:48,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:48,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:25:48,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:48,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:48,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-19 08:25:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:48,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555440990] [2022-11-19 08:25:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:48,482 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-19 08:25:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:48,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:48,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:48,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:25:48,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:48,595 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-19 08:25:48,622 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-19 08:25:48,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:48,622 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555440990] [2022-11-19 08:25:48,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555440990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:48,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:48,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:25:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832111657] [2022-11-19 08:25:48,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:48,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:25:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:25:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:48,626 INFO L87 Difference]: Start difference. First operand 607 states and 653 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-19 08:25:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:50,556 INFO L93 Difference]: Finished difference Result 674 states and 724 transitions. [2022-11-19 08:25:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:25:50,558 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-19 08:25:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:50,562 INFO L225 Difference]: With dead ends: 674 [2022-11-19 08:25:50,562 INFO L226 Difference]: Without dead ends: 674 [2022-11-19 08:25:50,562 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-19 08:25:50,563 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 254 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:50,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 748 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-19 08:25:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-19 08:25:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 629. [2022-11-19 08:25:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 351 states have (on average 1.9458689458689458) internal successors, (683), 623 states have internal predecessors, (683), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 709 transitions. [2022-11-19 08:25:50,588 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 709 transitions. Word has length 5 [2022-11-19 08:25:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:50,588 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 709 transitions. [2022-11-19 08:25:50,588 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-19 08:25:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 709 transitions. [2022-11-19 08:25:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:25:50,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:50,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:25:50,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:50,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:50,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1156729148, now seen corresponding path program 1 times [2022-11-19 08:25:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:50,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132194647] [2022-11-19 08:25:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:50,802 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-19 08:25:50,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:50,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:50,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:50,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:25:50,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:50,897 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-19 08:25:50,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:50,897 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:50,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132194647] [2022-11-19 08:25:50,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132194647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:50,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:50,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:25:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427549564] [2022-11-19 08:25:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:25:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:25:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:50,900 INFO L87 Difference]: Start difference. First operand 629 states and 709 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-19 08:25:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:51,000 INFO L93 Difference]: Finished difference Result 1209 states and 1349 transitions. [2022-11-19 08:25:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:25:51,004 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-19 08:25:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:51,009 INFO L225 Difference]: With dead ends: 1209 [2022-11-19 08:25:51,009 INFO L226 Difference]: Without dead ends: 1209 [2022-11-19 08:25:51,010 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-19 08:25:51,011 INFO L413 NwaCegarLoop]: 862 mSDtfsCounter, 567 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1499 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-19 08:25:51,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1499 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:25:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-11-19 08:25:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 630. [2022-11-19 08:25:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 352 states have (on average 1.9431818181818181) internal successors, (684), 624 states have internal predecessors, (684), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 710 transitions. [2022-11-19 08:25:51,033 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 710 transitions. Word has length 6 [2022-11-19 08:25:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:51,034 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 710 transitions. [2022-11-19 08:25:51,034 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-19 08:25:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 710 transitions. [2022-11-19 08:25:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:25:51,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:51,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:25:51,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:51,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-19 08:25:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:51,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533617791] [2022-11-19 08:25:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:51,248 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-19 08:25:51,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:51,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:51,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:25:51,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:51,413 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-19 08:25:51,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:51,414 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:51,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533617791] [2022-11-19 08:25:51,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533617791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:51,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:51,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:25:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326129283] [2022-11-19 08:25:51,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:51,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:25:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:25:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:51,417 INFO L87 Difference]: Start difference. First operand 630 states and 710 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-19 08:25:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:51,451 INFO L93 Difference]: Finished difference Result 594 states and 673 transitions. [2022-11-19 08:25:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:25:51,452 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-19 08:25:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:51,455 INFO L225 Difference]: With dead ends: 594 [2022-11-19 08:25:51,455 INFO L226 Difference]: Without dead ends: 594 [2022-11-19 08:25:51,456 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-19 08:25:51,456 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 561 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 625 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-19 08:25:51,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 625 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:25:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-19 08:25:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 588. [2022-11-19 08:25:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 334 states have (on average 1.9191616766467066) internal successors, (641), 582 states have internal predecessors, (641), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 667 transitions. [2022-11-19 08:25:51,472 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 667 transitions. Word has length 11 [2022-11-19 08:25:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:51,473 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 667 transitions. [2022-11-19 08:25:51,473 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-19 08:25:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 667 transitions. [2022-11-19 08:25:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:25:51,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:51,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:25:51,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-19 08:25:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:51,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176696742] [2022-11-19 08:25:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:51,688 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-19 08:25:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:51,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:51,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:25:51,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:51,854 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-19 08:25:51,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:51,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:51,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176696742] [2022-11-19 08:25:51,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176696742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:51,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:51,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:25:51,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676163703] [2022-11-19 08:25:51,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:51,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:25:51,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:51,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:25:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:25:51,866 INFO L87 Difference]: Start difference. First operand 588 states and 667 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-19 08:25:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:51,953 INFO L93 Difference]: Finished difference Result 573 states and 645 transitions. [2022-11-19 08:25:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:25:51,954 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-19 08:25:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:51,956 INFO L225 Difference]: With dead ends: 573 [2022-11-19 08:25:51,957 INFO L226 Difference]: Without dead ends: 573 [2022-11-19 08:25:51,957 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-19 08:25:51,960 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 542 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1123 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-19 08:25:51,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:25:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-11-19 08:25:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 566. [2022-11-19 08:25:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 326 states have (on average 1.8773006134969326) internal successors, (612), 560 states have internal predecessors, (612), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 638 transitions. [2022-11-19 08:25:51,976 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 638 transitions. Word has length 13 [2022-11-19 08:25:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:51,978 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 638 transitions. [2022-11-19 08:25:51,978 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-19 08:25:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 638 transitions. [2022-11-19 08:25:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 08:25:51,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:51,979 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-19 08:25:51,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-19 08:25:52,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:52,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-19 08:25:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:52,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574594244] [2022-11-19 08:25:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:52,195 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-19 08:25:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:52,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:52,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:52,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:25:52,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:52,329 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-19 08:25:52,430 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-19 08:25:52,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:52,431 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:52,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574594244] [2022-11-19 08:25:52,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574594244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:52,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:52,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:25:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842954273] [2022-11-19 08:25:52,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:52,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:25:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:52,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:25:52,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:25:52,439 INFO L87 Difference]: Start difference. First operand 566 states and 638 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-19 08:25:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:53,972 INFO L93 Difference]: Finished difference Result 610 states and 703 transitions. [2022-11-19 08:25:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:25:53,973 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-19 08:25:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:53,976 INFO L225 Difference]: With dead ends: 610 [2022-11-19 08:25:53,976 INFO L226 Difference]: Without dead ends: 610 [2022-11-19 08:25:53,976 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-19 08:25:53,977 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 956 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:53,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 383 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-19 08:25:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-19 08:25:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 562. [2022-11-19 08:25:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 326 states have (on average 1.8650306748466257) internal successors, (608), 556 states have internal predecessors, (608), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 634 transitions. [2022-11-19 08:25:53,994 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 634 transitions. Word has length 27 [2022-11-19 08:25:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:53,994 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 634 transitions. [2022-11-19 08:25:53,995 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-19 08:25:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 634 transitions. [2022-11-19 08:25:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 08:25:53,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:53,996 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-19 08:25:54,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-19 08:25:54,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:54,207 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-19 08:25:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383878512] [2022-11-19 08:25:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:54,209 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-19 08:25:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:54,209 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:54,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:54,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:25:54,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:54,371 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-19 08:25:54,589 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-19 08:25:54,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:54,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:54,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383878512] [2022-11-19 08:25:54,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383878512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:54,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:54,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:25:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608028777] [2022-11-19 08:25:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:54,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:25:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:25:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:25:54,592 INFO L87 Difference]: Start difference. First operand 562 states and 634 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-19 08:25:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:56,853 INFO L93 Difference]: Finished difference Result 644 states and 706 transitions. [2022-11-19 08:25:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:25:56,857 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-19 08:25:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:56,860 INFO L225 Difference]: With dead ends: 644 [2022-11-19 08:25:56,860 INFO L226 Difference]: Without dead ends: 644 [2022-11-19 08:25:56,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:25:56,861 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 351 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:56,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 917 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-19 08:25:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-19 08:25:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 558. [2022-11-19 08:25:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 326 states have (on average 1.852760736196319) internal successors, (604), 552 states have internal predecessors, (604), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 630 transitions. [2022-11-19 08:25:56,879 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 630 transitions. Word has length 27 [2022-11-19 08:25:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:56,880 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 630 transitions. [2022-11-19 08:25:56,881 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-19 08:25:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 630 transitions. [2022-11-19 08:25:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-19 08:25:56,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:56,882 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-19 08:25:56,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-19 08:25:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:57,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747546768] [2022-11-19 08:25:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:57,108 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-19 08:25:57,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:57,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:57,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:25:57,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:57,389 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-19 08:25:57,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:57,390 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747546768] [2022-11-19 08:25:57,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747546768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:57,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:57,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:25:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337953198] [2022-11-19 08:25:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:57,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:25:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:25:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:25:57,393 INFO L87 Difference]: Start difference. First operand 558 states and 630 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-19 08:25:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:57,458 INFO L93 Difference]: Finished difference Result 558 states and 626 transitions. [2022-11-19 08:25:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:25:57,459 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-19 08:25:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:57,462 INFO L225 Difference]: With dead ends: 558 [2022-11-19 08:25:57,462 INFO L226 Difference]: Without dead ends: 558 [2022-11-19 08:25:57,463 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-19 08:25:57,464 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 511 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1101 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:57,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1101 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:25:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-19 08:25:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 552. [2022-11-19 08:25:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 320 states have (on average 1.85625) internal successors, (594), 546 states have internal predecessors, (594), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 620 transitions. [2022-11-19 08:25:57,477 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 620 transitions. Word has length 42 [2022-11-19 08:25:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:57,477 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 620 transitions. [2022-11-19 08:25:57,478 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-19 08:25:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 620 transitions. [2022-11-19 08:25:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 08:25:57,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:57,479 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-19 08:25:57,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-19 08:25:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:57,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229498491] [2022-11-19 08:25:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:57,694 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-19 08:25:57,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:57,698 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:57,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:25:57,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:58,219 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-19 08:25:58,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:58,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:58,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229498491] [2022-11-19 08:25:58,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229498491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:58,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:58,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:25:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313585135] [2022-11-19 08:25:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:58,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:25:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:25:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:58,222 INFO L87 Difference]: Start difference. First operand 552 states and 620 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-19 08:25:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:58,319 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2022-11-19 08:25:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:25:58,321 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-19 08:25:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:58,323 INFO L225 Difference]: With dead ends: 598 [2022-11-19 08:25:58,329 INFO L226 Difference]: Without dead ends: 598 [2022-11-19 08:25:58,330 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-19 08:25:58,331 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 67 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:58,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1008 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:25:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-19 08:25:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-11-19 08:25:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 366 states have (on average 1.7486338797814207) internal successors, (640), 592 states have internal predecessors, (640), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:25:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 666 transitions. [2022-11-19 08:25:58,343 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 666 transitions. Word has length 50 [2022-11-19 08:25:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:58,344 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 666 transitions. [2022-11-19 08:25:58,344 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-19 08:25:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 666 transitions. [2022-11-19 08:25:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 08:25:58,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:58,345 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-19 08:25:58,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:58,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:58,559 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:25:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-19 08:25:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:25:58,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624223578] [2022-11-19 08:25:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:58,561 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-19 08:25:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:25:58,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:58,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:25:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:58,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:25:58,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:58,893 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-19 08:25:58,902 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-19 08:25:59,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:25:59,415 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-19 08:25:59,433 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:25:59,433 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-19 08:25:59,450 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-19 08:25:59,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:25:59,451 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624223578] [2022-11-19 08:25:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624223578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:59,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:59,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:25:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431704251] [2022-11-19 08:25:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:59,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:25:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:25:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:25:59,453 INFO L87 Difference]: Start difference. First operand 598 states and 666 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-19 08:26:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:00,951 INFO L93 Difference]: Finished difference Result 567 states and 636 transitions. [2022-11-19 08:26:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:26:00,953 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-19 08:26:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:00,956 INFO L225 Difference]: With dead ends: 567 [2022-11-19 08:26:00,957 INFO L226 Difference]: Without dead ends: 567 [2022-11-19 08:26:00,957 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-19 08:26:00,958 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 441 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:00,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 311 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-19 08:26:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-19 08:26:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 528. [2022-11-19 08:26:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 334 states have (on average 1.6047904191616766) internal successors, (536), 522 states have internal predecessors, (536), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:26:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 562 transitions. [2022-11-19 08:26:00,971 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 562 transitions. Word has length 53 [2022-11-19 08:26:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:00,972 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 562 transitions. [2022-11-19 08:26:00,972 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-19 08:26:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 562 transitions. [2022-11-19 08:26:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 08:26:00,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:00,975 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-19 08:26:01,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:01,192 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-19 08:26:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:01,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146903097] [2022-11-19 08:26:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:01,194 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-19 08:26:01,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:01,195 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:01,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:01,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:26:01,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:01,445 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-19 08:26:01,466 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-19 08:26:01,498 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-19 08:26:01,511 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-19 08:26:01,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:26:01,511 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:01,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146903097] [2022-11-19 08:26:01,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146903097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:01,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:01,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:26:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593449475] [2022-11-19 08:26:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:01,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:26:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:01,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:26:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:26:01,514 INFO L87 Difference]: Start difference. First operand 528 states and 562 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-19 08:26:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:03,412 INFO L93 Difference]: Finished difference Result 527 states and 561 transitions. [2022-11-19 08:26:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:26:03,414 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-19 08:26:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:03,416 INFO L225 Difference]: With dead ends: 527 [2022-11-19 08:26:03,416 INFO L226 Difference]: Without dead ends: 527 [2022-11-19 08:26:03,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:26:03,417 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 4 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:03,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1317 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-19 08:26:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-19 08:26:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2022-11-19 08:26:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 334 states have (on average 1.6017964071856288) internal successors, (535), 521 states have internal predecessors, (535), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:26:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 561 transitions. [2022-11-19 08:26:03,430 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 561 transitions. Word has length 58 [2022-11-19 08:26:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:03,430 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 561 transitions. [2022-11-19 08:26:03,431 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-19 08:26:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 561 transitions. [2022-11-19 08:26:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 08:26:03,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:03,432 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-19 08:26:03,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-19 08:26:03,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:03,646 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-19 08:26:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:03,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843373419] [2022-11-19 08:26:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:03,648 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-19 08:26:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:03,649 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:03,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:03,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:26:03,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:03,967 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-19 08:26:04,001 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-19 08:26:04,013 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-19 08:26:04,076 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-19 08:26:04,089 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-19 08:26:04,108 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-19 08:26:04,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:26:04,109 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843373419] [2022-11-19 08:26:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843373419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:04,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:04,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:26:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110879220] [2022-11-19 08:26:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:04,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:26:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:26:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:26:04,111 INFO L87 Difference]: Start difference. First operand 527 states and 561 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-19 08:26:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:06,428 INFO L93 Difference]: Finished difference Result 526 states and 560 transitions. [2022-11-19 08:26:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:26:06,430 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-19 08:26:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:06,432 INFO L225 Difference]: With dead ends: 526 [2022-11-19 08:26:06,432 INFO L226 Difference]: Without dead ends: 526 [2022-11-19 08:26:06,432 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-19 08:26:06,433 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:06,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1327 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-19 08:26:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-19 08:26:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-11-19 08:26:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 333 states have (on average 1.6036036036036037) internal successors, (534), 520 states have internal predecessors, (534), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 08:26:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 560 transitions. [2022-11-19 08:26:06,445 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 560 transitions. Word has length 58 [2022-11-19 08:26:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:06,445 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 560 transitions. [2022-11-19 08:26:06,445 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-19 08:26:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 560 transitions. [2022-11-19 08:26:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 08:26:06,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:06,447 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-19 08:26:06,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:06,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:06,673 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1630154942, now seen corresponding path program 1 times [2022-11-19 08:26:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:06,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127517524] [2022-11-19 08:26:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:26:06,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:06,676 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:06,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:06,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:26:06,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:06,958 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-19 08:26:06,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:26:06,958 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:06,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127517524] [2022-11-19 08:26:06,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127517524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:06,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:06,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:26:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572545856] [2022-11-19 08:26:06,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:06,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:26:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:26:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:26:06,961 INFO L87 Difference]: Start difference. First operand 526 states and 560 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-19 08:26:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:07,010 INFO L93 Difference]: Finished difference Result 529 states and 564 transitions. [2022-11-19 08:26:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:26:07,011 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-19 08:26:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:07,014 INFO L225 Difference]: With dead ends: 529 [2022-11-19 08:26:07,014 INFO L226 Difference]: Without dead ends: 529 [2022-11-19 08:26:07,014 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-19 08:26:07,015 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 2 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:07,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1525 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:26:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-11-19 08:26:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-11-19 08:26:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 335 states have (on average 1.6029850746268657) internal successors, (537), 523 states have internal predecessors, (537), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:26:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 564 transitions. [2022-11-19 08:26:07,026 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 564 transitions. Word has length 66 [2022-11-19 08:26:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:07,027 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 564 transitions. [2022-11-19 08:26:07,027 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-19 08:26:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 564 transitions. [2022-11-19 08:26:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:26:07,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:07,028 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-19 08:26:07,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:07,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:07,241 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash 584186051, now seen corresponding path program 1 times [2022-11-19 08:26:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:07,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205479501] [2022-11-19 08:26:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:07,243 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-19 08:26:07,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:07,244 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:07,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:07,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:26:07,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:07,576 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-19 08:26:07,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:07,695 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-19 08:26:07,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205479501] [2022-11-19 08:26:07,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205479501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1077996625] [2022-11-19 08:26:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:07,701 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:07,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:26:07,704 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:26:07,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-19 08:26:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:08,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:26:08,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:08,255 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-19 08:26:08,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:08,307 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-19 08:26:08,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1077996625] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347674897] [2022-11-19 08:26:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:08,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:08,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:08,316 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:08,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 08:26:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:08,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:26:08,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:08,628 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-19 08:26:08,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:08,673 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-19 08:26:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347674897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:08,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:26:08,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-19 08:26:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930796833] [2022-11-19 08:26:08,674 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:26:08,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:26:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:26:08,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:26:08,675 INFO L87 Difference]: Start difference. First operand 529 states and 564 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-19 08:26:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:08,890 INFO L93 Difference]: Finished difference Result 541 states and 581 transitions. [2022-11-19 08:26:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:26:08,891 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-19 08:26:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:08,893 INFO L225 Difference]: With dead ends: 541 [2022-11-19 08:26:08,893 INFO L226 Difference]: Without dead ends: 541 [2022-11-19 08:26:08,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:26:08,896 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 23 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:08,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1529 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:26:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-19 08:26:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2022-11-19 08:26:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 344 states have (on average 1.6046511627906976) internal successors, (552), 532 states have internal predecessors, (552), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:26:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 579 transitions. [2022-11-19 08:26:08,912 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 579 transitions. Word has length 67 [2022-11-19 08:26:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:08,912 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 579 transitions. [2022-11-19 08:26:08,912 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-19 08:26:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 579 transitions. [2022-11-19 08:26:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 08:26:08,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:08,914 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-19 08:26:08,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:09,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:09,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:09,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:09,539 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1893632510, now seen corresponding path program 2 times [2022-11-19 08:26:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:09,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681890882] [2022-11-19 08:26:09,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:09,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:26:09,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:09,541 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:09,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:09,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:26:09,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:09,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:26:09,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:10,056 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-19 08:26:10,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:10,300 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-19 08:26:10,300 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:10,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681890882] [2022-11-19 08:26:10,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681890882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:10,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [890479573] [2022-11-19 08:26:10,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:10,301 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:10,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:26:10,304 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:26:10,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-19 08:26:11,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:26:11,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:11,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:26:11,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:11,528 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-19 08:26:11,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:11,625 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-19 08:26:11,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [890479573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:11,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271125869] [2022-11-19 08:26:11,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:11,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:11,628 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:11,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 08:26:33,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:26:33,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:33,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 08:26:33,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:33,909 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:26:33,910 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-19 08:26:33,951 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-19 08:26:34,513 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:26:34,514 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-19 08:26:34,614 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-19 08:26:34,654 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-19 08:26:34,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:34,801 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 08:26:34,801 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-19 08:26:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271125869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:26:34,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:26:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-19 08:26:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110334661] [2022-11-19 08:26:34,937 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:26:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 08:26:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:34,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 08:26:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=552, Unknown=8, NotChecked=0, Total=650 [2022-11-19 08:26:34,939 INFO L87 Difference]: Start difference. First operand 539 states and 579 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-19 08:26:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:45,764 INFO L93 Difference]: Finished difference Result 867 states and 937 transitions. [2022-11-19 08:26:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-19 08:26:45,765 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-19 08:26:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:45,767 INFO L225 Difference]: With dead ends: 867 [2022-11-19 08:26:45,767 INFO L226 Difference]: Without dead ends: 863 [2022-11-19 08:26:45,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=320, Invalid=2000, Unknown=32, NotChecked=0, Total=2352 [2022-11-19 08:26:45,769 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 834 mSDsluCounter, 4676 mSDsCounter, 0 mSdLazyCounter, 4780 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 5110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:45,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 5104 Invalid, 5110 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 4780 Invalid, 0 Unknown, 292 Unchecked, 9.5s Time] [2022-11-19 08:26:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-11-19 08:26:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 543. [2022-11-19 08:26:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 349 states have (on average 1.5931232091690544) internal successors, (556), 536 states have internal predecessors, (556), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:26:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 583 transitions. [2022-11-19 08:26:45,783 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 583 transitions. Word has length 70 [2022-11-19 08:26:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:45,783 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 583 transitions. [2022-11-19 08:26:45,784 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-19 08:26:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 583 transitions. [2022-11-19 08:26:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-19 08:26:45,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:45,785 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:26:45,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:46,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:46,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-11-19 08:26:46,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:46,400 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash -151374268, now seen corresponding path program 1 times [2022-11-19 08:26:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:46,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136828415] [2022-11-19 08:26:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:46,402 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-19 08:26:46,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:46,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:46,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:46,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:26:46,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:46,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:47,462 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:47,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136828415] [2022-11-19 08:26:47,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136828415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:47,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [359279189] [2022-11-19 08:26:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:26:47,465 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:26:47,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-19 08:26:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:48,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:26:48,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:48,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:48,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [359279189] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:48,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975965802] [2022-11-19 08:26:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:48,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:48,373 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:48,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-19 08:26:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:48,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:26:48,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:48,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975965802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:49,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:26:49,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2022-11-19 08:26:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447790241] [2022-11-19 08:26:49,772 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:26:49,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:26:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:26:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:26:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 08:26:49,775 INFO L87 Difference]: Start difference. First operand 543 states and 583 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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-19 08:26:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:53,169 INFO L93 Difference]: Finished difference Result 584 states and 640 transitions. [2022-11-19 08:26:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-19 08:26:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 75 [2022-11-19 08:26:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:53,172 INFO L225 Difference]: With dead ends: 584 [2022-11-19 08:26:53,172 INFO L226 Difference]: Without dead ends: 578 [2022-11-19 08:26:53,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2022-11-19 08:26:53,174 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 154 mSDsluCounter, 7664 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:53,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 8181 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-19 08:26:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-19 08:26:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 562. [2022-11-19 08:26:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 368 states have (on average 1.5815217391304348) internal successors, (582), 555 states have internal predecessors, (582), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:26:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 609 transitions. [2022-11-19 08:26:53,186 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 609 transitions. Word has length 75 [2022-11-19 08:26:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:53,187 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 609 transitions. [2022-11-19 08:26:53,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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-19 08:26:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 609 transitions. [2022-11-19 08:26:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-19 08:26:53,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:53,188 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:26:53,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-19 08:26:53,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:53,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:53,808 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:26:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 398307071, now seen corresponding path program 2 times [2022-11-19 08:26:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:26:53,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218708434] [2022-11-19 08:26:53,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:53,810 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-19 08:26:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:26:53,811 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:53,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:26:54,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:26:54,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:54,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 08:26:54,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:55,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:58,625 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:26:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218708434] [2022-11-19 08:26:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218708434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:58,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [465617329] [2022-11-19 08:26:58,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:26:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:26:58,632 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:26:58,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-19 08:27:00,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:27:00,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:27:00,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 08:27:00,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:00,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [465617329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043751970] [2022-11-19 08:27:01,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:27:01,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:01,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:01,533 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:01,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-19 08:27:12,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:27:12,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:27:12,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 08:27:12,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:12,644 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:27:12,645 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-19 08:27:12,656 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-19 08:27:12,796 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-19 08:27:12,808 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-19 08:27:13,229 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-19 08:27:13,236 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-19 08:27:13,412 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2317 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2317))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:27:13,586 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322)))) is different from true [2022-11-19 08:27:13,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327)))) is different from true [2022-11-19 08:27:14,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 08:27:14,246 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336)))) is different from true [2022-11-19 08:27:14,262 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_2337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2338) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:27:14,433 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:27:14,746 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347)))) is different from true [2022-11-19 08:27:14,758 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_2350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2350))) (exists ((v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2349)))) is different from true [2022-11-19 08:27:14,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354))) (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 08:27:15,128 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:27:15,130 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-19 08:27:15,138 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-19 08:27:15,361 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-19 08:27:15,369 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-19 08:27:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 155 not checked. [2022-11-19 08:27:15,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:16,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-19 08:27:16,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043751970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:16,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:27:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 19] total 64 [2022-11-19 08:27:16,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137288151] [2022-11-19 08:27:16,408 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:27:16,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-19 08:27:16,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:27:16,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-19 08:27:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2468, Unknown=37, NotChecked=1298, Total=4422 [2022-11-19 08:27:16,411 INFO L87 Difference]: Start difference. First operand 562 states and 609 transitions. Second operand has 64 states, 63 states have (on average 2.888888888888889) internal successors, (182), 64 states have internal predecessors, (182), 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-19 08:27:37,585 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr142|) |c_#Ultimate.C_memset_#amount|)) (.cse4 (bvult |c_#Ultimate.C_memset_#t~loopctr142| |c_#Ultimate.C_memset_#amount|)) (.cse3 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv3 32)) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32)))) (.cse5 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr142|) |c_#Ultimate.C_memset_#amount|))) (and (or .cse0 .cse1 (not .cse2)) (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|)) (or .cse0 .cse3 (not .cse4)) (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342))) (exists ((v_ArrVal_2319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2319))) (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354))) (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328))) (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.offset|)) (or (not .cse1) .cse0 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr142| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|)) (or .cse4 .cse0) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332))) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2337) |c_#memory_$Pointer$.offset|)) (or (not .cse3) .cse0 .cse5) (or .cse2 .cse0 (not .cse5)) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2350))) (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322))) (exists ((v_ArrVal_2320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2320))) (exists ((v_ArrVal_2338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347))) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327))) (exists ((v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2349))))) is different from true [2022-11-19 08:27:40,726 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342))) (exists ((v_ArrVal_2319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2319))) (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354))) (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328))) (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332))) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2350))) (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322))) (exists ((v_ArrVal_2320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2320))) (exists ((v_ArrVal_2338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347))) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327))) (exists ((v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2349)))) is different from true [2022-11-19 08:28:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:11,042 INFO L93 Difference]: Finished difference Result 944 states and 1061 transitions. [2022-11-19 08:28:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-19 08:28:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.888888888888889) internal successors, (182), 64 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2022-11-19 08:28:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:11,046 INFO L225 Difference]: With dead ends: 944 [2022-11-19 08:28:11,047 INFO L226 Difference]: Without dead ends: 934 [2022-11-19 08:28:11,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 350 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2898 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=2651, Invalid=13152, Unknown=251, NotChecked=3406, Total=19460 [2022-11-19 08:28:11,053 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 1169 mSDsluCounter, 10369 mSDsCounter, 0 mSdLazyCounter, 13159 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 10801 SdHoareTripleChecker+Invalid, 20879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 13159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7653 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:11,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 10801 Invalid, 20879 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [67 Valid, 13159 Invalid, 0 Unknown, 7653 Unchecked, 29.2s Time] [2022-11-19 08:28:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2022-11-19 08:28:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 593. [2022-11-19 08:28:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 400 states have (on average 1.5475) internal successors, (619), 586 states have internal predecessors, (619), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:28:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 646 transitions. [2022-11-19 08:28:11,072 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 646 transitions. Word has length 86 [2022-11-19 08:28:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:11,072 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 646 transitions. [2022-11-19 08:28:11,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.888888888888889) internal successors, (182), 64 states have internal predecessors, (182), 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-19 08:28:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 646 transitions. [2022-11-19 08:28:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-19 08:28:11,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:11,074 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:28:11,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:11,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:11,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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)] Ended with exit code 0 [2022-11-19 08:28:11,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:28:11,694 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:28:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash -127995950, now seen corresponding path program 1 times [2022-11-19 08:28:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:28:11,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251300547] [2022-11-19 08:28:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:11,696 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-19 08:28:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:28:11,698 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:28:11,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:28:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:12,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 08:28:12,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:13,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:20,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:28:20,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251300547] [2022-11-19 08:28:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251300547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:20,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1891731336] [2022-11-19 08:28:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:20,135 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:28:20,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:28:20,136 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:28:20,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-19 08:28:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:21,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 08:28:21,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:21,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:22,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1891731336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143733550] [2022-11-19 08:28:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:22,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:22,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:22,612 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:22,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-19 08:28:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:23,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 08:28:23,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:23,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:35,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143733550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:35,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:28:35,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2022-11-19 08:28:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277992467] [2022-11-19 08:28:35,272 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:28:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-19 08:28:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:28:35,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-19 08:28:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2022-11-19 08:28:35,280 INFO L87 Difference]: Start difference. First operand 593 states and 646 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-19 08:29:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:47,955 INFO L93 Difference]: Finished difference Result 739 states and 853 transitions. [2022-11-19 08:29:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-19 08:29:47,956 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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 110 [2022-11-19 08:29:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:47,959 INFO L225 Difference]: With dead ends: 739 [2022-11-19 08:29:47,959 INFO L226 Difference]: Without dead ends: 733 [2022-11-19 08:29:47,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7404 ImplicationChecksByTransitivity, 74.3s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2022-11-19 08:29:47,970 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 1114 mSDsluCounter, 26312 mSDsCounter, 0 mSdLazyCounter, 7116 mSolverCounterSat, 1327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 26858 SdHoareTripleChecker+Invalid, 8443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1327 IncrementalHoareTripleChecker+Valid, 7116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:47,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 26858 Invalid, 8443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1327 Valid, 7116 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-11-19 08:29:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-11-19 08:29:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 657. [2022-11-19 08:29:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 464 states have (on average 1.5172413793103448) internal successors, (704), 650 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:29:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 731 transitions. [2022-11-19 08:29:47,986 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 731 transitions. Word has length 110 [2022-11-19 08:29:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:47,986 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 731 transitions. [2022-11-19 08:29:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-19 08:29:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 731 transitions. [2022-11-19 08:29:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 08:29:47,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:47,988 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-19 08:29:48,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:29:48,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:48,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:48,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:48,606 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:29:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1359083593, now seen corresponding path program 2 times [2022-11-19 08:29:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:29:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625732394] [2022-11-19 08:29:48,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:29:48,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:29:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:29:48,608 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:29:48,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:29:49,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:29:49,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:29:49,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:29:49,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:49,364 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 08:29:49,364 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 39 treesize of output 29 [2022-11-19 08:29:49,427 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-19 08:29:49,428 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-19 08:29:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-19 08:29:49,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:29:49,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:29:49,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625732394] [2022-11-19 08:29:49,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625732394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:29:49,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:29:49,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:29:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62350759] [2022-11-19 08:29:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:29:49,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:29:49,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:29:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:29:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:29:49,450 INFO L87 Difference]: Start difference. First operand 657 states and 731 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-19 08:29:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:51,061 INFO L93 Difference]: Finished difference Result 656 states and 730 transitions. [2022-11-19 08:29:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:29:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 113 [2022-11-19 08:29:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:51,065 INFO L225 Difference]: With dead ends: 656 [2022-11-19 08:29:51,065 INFO L226 Difference]: Without dead ends: 656 [2022-11-19 08:29:51,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:29:51,066 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 5 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:51,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1507 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 248 Unchecked, 1.6s Time] [2022-11-19 08:29:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-19 08:29:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-11-19 08:29:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 464 states have (on average 1.5150862068965518) internal successors, (703), 649 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-19 08:29:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 730 transitions. [2022-11-19 08:29:51,078 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 730 transitions. Word has length 113 [2022-11-19 08:29:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:51,078 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 730 transitions. [2022-11-19 08:29:51,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-19 08:29:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 730 transitions. [2022-11-19 08:29:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 08:29:51,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:51,080 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-19 08:29:51,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:29:51,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:29:51,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-11-19 08:29:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1359083592, now seen corresponding path program 1 times [2022-11-19 08:29:51,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:29:51,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815130607] [2022-11-19 08:29:51,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:51,296 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-19 08:29:51,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:29:51,297 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:29:51,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-19 08:29:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:52,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 08:29:52,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:52,322 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-19 08:29:52,435 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-19 08:29:52,453 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:29:52,454 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-19 08:29:52,479 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-19 08:29:52,489 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-19 08:29:52,633 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-19 08:29:52,646 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-19 08:29:52,713 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146)))) is different from true [2022-11-19 08:29:52,725 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:52,935 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:52,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:29:52,991 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169)))) is different from true [2022-11-19 08:29:53,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173)))) is different from true [2022-11-19 08:29:53,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175)))) is different from true [2022-11-19 08:29:53,065 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176)))) is different from true [2022-11-19 08:29:53,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:53,097 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,113 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:29:53,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,144 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:29:53,170 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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|))) is different from true [2022-11-19 08:29:53,187 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:29:53,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:29:53,215 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:29:53,230 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197)))) is different from true [2022-11-19 08:29:53,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,260 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200)))) is different from true [2022-11-19 08:29:53,279 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2022-11-19 08:29:53,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,327 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208)))) is different from true [2022-11-19 08:29:53,342 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:29:53,358 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:29:53,373 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:29:53,387 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:29:53,401 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219)))) is different from true [2022-11-19 08:29:53,415 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:29:53,430 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223)))) is different from true [2022-11-19 08:29:53,444 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224)))) is different from true [2022-11-19 08:29:53,459 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227)))) is different from true [2022-11-19 08:29:53,473 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229)))) is different from true [2022-11-19 08:29:53,487 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:29:53,501 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:29:53,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:53,557 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-19 08:29:53,574 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-19 08:29:53,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:53,738 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-19 08:29:53,749 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-19 08:29:53,780 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-19 08:29:53,783 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-19 08:29:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-19 08:29:53,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:54,046 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-19 08:29:54,090 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_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:29:55,166 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4326) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4327))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4326) .cse2 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:29:55,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:29:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815130607] [2022-11-19 08:29:55,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815130607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2107531753] [2022-11-19 08:29:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:55,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:29:55,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:29:55,176 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:29:55,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-19 08:31:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:51,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-19 08:31:51,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:51,664 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-19 08:31:51,793 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-19 08:31:51,809 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:31:51,810 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-19 08:31:51,834 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-19 08:31:51,849 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-19 08:31:51,923 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-19 08:31:51,930 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-19 08:31:51,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693)))) is different from true [2022-11-19 08:31:52,005 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,022 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2022-11-19 08:31:52,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699))) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,050 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:52,064 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4703))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702)))) is different from true [2022-11-19 08:31:52,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707)))) is different from true [2022-11-19 08:31:52,108 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709)))) is different from true [2022-11-19 08:31:52,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712)))) is different from true [2022-11-19 08:31:52,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4716)))) is different from true [2022-11-19 08:31:52,182 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:52,196 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:52,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4723)))) is different from true [2022-11-19 08:31:52,226 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:52,252 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728)))) is different from true [2022-11-19 08:31:52,290 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:52,305 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732)))) is different from true [2022-11-19 08:31:52,319 WARN L859 $PredicateComparison]: unable to prove that (and (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|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,332 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736)))) is different from true [2022-11-19 08:31:52,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:52,360 WARN L859 $PredicateComparison]: unable to prove that (and (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))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,373 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:52,387 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745)))) is different from true [2022-11-19 08:31:52,401 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746)))) is different from true [2022-11-19 08:31:52,415 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:52,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,442 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-11-19 08:31:52,459 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:52,472 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_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|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,487 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:52,501 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761))) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-19 08:31:52,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763)))) is different from true [2022-11-19 08:31:52,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:52,541 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:31:52,553 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:52,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:52,579 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773)))) is different from true [2022-11-19 08:31:52,592 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:31:52,604 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_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))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:52,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:52,665 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:31:52,665 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-19 08:31:52,687 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-19 08:31:52,794 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:31:52,795 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-19 08:31:52,818 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-19 08:31:52,861 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-19 08:31:52,865 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-19 08:31:52,873 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-19 08:31:52,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:52,950 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:31:52,992 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_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:31:53,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4872))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4873) .cse0 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (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_4873) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-19 08:31:53,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2107531753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912379070] [2022-11-19 08:31:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:53,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:53,975 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:53,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80596e3c-9e36-4bac-838d-d7687da9f83c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-19 08:31:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:54,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 08:31:54,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:54,826 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-19 08:31:54,840 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:31:54,841 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-19 08:31:54,852 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-19 08:31:54,860 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-19 08:31:54,933 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-19 08:31:54,938 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-19 08:31:55,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238)))) is different from true [2022-11-19 08:31:55,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243)))) is different from true [2022-11-19 08:31:55,102 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248)))) is different from true [2022-11-19 08:31:55,131 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:55,145 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251)))) is different from true [2022-11-19 08:31:55,159 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253)))) is different from true [2022-11-19 08:31:55,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:55,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:55,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,227 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264)))) is different from true [2022-11-19 08:31:55,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265)))) is different from true [2022-11-19 08:31:55,256 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:55,268 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,282 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271)))) is different from true [2022-11-19 08:31:55,294 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273)))) is different from true [2022-11-19 08:31:55,307 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-11-19 08:31:55,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,340 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:55,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-19 08:31:55,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:55,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:55,397 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,411 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292)))) is different from true [2022-11-19 08:31:55,424 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_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))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,446 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,457 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:31:55,469 WARN L859 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:31:55,480 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-11-19 08:31:55,494 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304)))) is different from true [2022-11-19 08:31:55,505 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:31:55,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-19 08:31:55,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310)))) is different from true [2022-11-19 08:31:55,549 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_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|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:31:55,562 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,574 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,586 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,598 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-11-19 08:31:55,609 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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-19 08:31:55,659 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:31:55,659 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-19 08:31:55,672 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-19 08:31:55,788 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:31:55,788 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-19 08:31:55,801 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-19 08:31:55,825 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-19 08:31:55,828 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-19 08:31:55,837 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-19 08:31:55,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:55,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (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_5325) |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_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:31:55,957 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_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-19 08:31:56,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5417) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5418) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5418))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5417) .cse2 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:31:56,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912379070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:56,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:56,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 52, 52] total 132 [2022-11-19 08:31:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530785014] [2022-11-19 08:31:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:31:56,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2022-11-19 08:31:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:31:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2022-11-19 08:31:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=251, Unknown=138, NotChecked=19912, Total=20592 [2022-11-19 08:31:56,901 INFO L87 Difference]: Start difference. First operand 656 states and 730 transitions. Second operand has 133 states, 131 states have (on average 1.702290076335878) internal successors, (223), 133 states have internal predecessors, (223), 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-19 08:31:57,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693))) (exists ((v_ArrVal_5237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5237))) (exists ((v_ArrVal_5238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5238)))) is different from true [2022-11-19 08:31:57,624 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:31:57,629 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2022-11-19 08:31:57,655 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_4703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4703))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,680 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,688 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (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_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (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))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,719 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (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_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (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_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (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))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,732 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (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_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (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_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (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_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (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))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (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))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:31:57,744 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.offset|)) (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_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246))) (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (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_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (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_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (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))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249))) (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (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))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (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_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4716))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:32:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:02,753 INFO L93 Difference]: Finished difference Result 673 states and 757 transitions. [2022-11-19 08:32:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-19 08:32:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 133 states, 131 states have (on average 1.702290076335878) internal successors, (223), 133 states have internal predecessors, (223), 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-19 08:32:02,756 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-19 08:32:02,756 INFO L78 Accepts]: Start accepts. Automaton has has 133 states, 131 states have (on average 1.702290076335878) internal successors, (223), 133 states have internal predecessors, (223), 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