./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:55:36,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:55:36,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:55:36,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:55:36,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:55:36,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:55:36,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:55:36,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:55:36,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:55:36,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:55:36,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:55:36,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:55:36,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:55:36,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:55:36,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:55:36,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:55:36,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:55:36,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:55:36,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:55:36,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:55:36,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:55:36,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:55:36,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:55:36,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:55:36,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:55:36,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:55:36,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:55:36,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:55:36,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:55:36,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:55:36,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:55:36,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:55:36,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:55:36,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:55:36,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:55:36,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:55:36,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:55:36,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:55:36,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:55:36,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:55:36,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:55:36,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:55:36,435 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:55:36,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:55:36,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:55:36,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:55:36,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:55:36,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:55:36,437 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:55:36,437 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:55:36,437 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:55:36,438 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:55:36,438 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:55:36,438 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:55:36,438 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:55:36,438 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:55:36,439 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:55:36,439 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:55:36,439 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:55:36,439 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:55:36,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:55:36,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:55:36,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:55:36,441 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:55:36,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:55:36,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:55:36,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:55:36,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:55:36,442 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:55:36,442 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:55:36,442 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:55:36,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:55:36,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:55:36,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:55:36,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:55:36,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:55:36,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:55:36,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:55:36,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:55:36,444 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:55:36,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:55:36,444 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:55:36,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:55:36,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:55:36,445 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_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2022-11-26 00:55:36,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:55:36,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:55:36,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:55:36,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:55:36,760 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:55:36,761 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2022-11-26 00:55:39,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:55:40,149 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:55:40,150 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2022-11-26 00:55:40,179 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data/05f57da00/711f77da084444308f102ac6bb0d1b49/FLAGada8b7d75 [2022-11-26 00:55:40,197 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data/05f57da00/711f77da084444308f102ac6bb0d1b49 [2022-11-26 00:55:40,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:55:40,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:55:40,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:55:40,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:55:40,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:55:40,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:55:40" (1/1) ... [2022-11-26 00:55:40,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c09938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:40, skipping insertion in model container [2022-11-26 00:55:40,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:55:40" (1/1) ... [2022-11-26 00:55:40,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:55:40,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:55:40,812 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2022-11-26 00:55:41,011 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:55:41,020 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2022-11-26 00:55:41,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:55:41,063 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-26 00:55:41,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@86f3625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:41, skipping insertion in model container [2022-11-26 00:55:41,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:55:41,065 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-26 00:55:41,067 INFO L158 Benchmark]: Toolchain (without parser) took 862.42ms. Allocated memory is still 155.2MB. Free memory was 113.6MB in the beginning and 109.3MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 00:55:41,068 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:55:41,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 859.88ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 109.3MB in the end (delta: 3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 00:55:41,070 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 115.3MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 859.88ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 109.3MB in the end (delta: 3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: 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_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:55:43,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:55:43,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:55:43,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:55:43,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:55:43,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:55:43,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:55:43,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:55:43,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:55:43,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:55:43,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:55:43,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:55:43,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:55:43,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:55:43,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:55:43,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:55:43,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:55:43,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:55:43,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:55:43,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:55:43,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:55:43,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:55:43,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:55:43,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:55:43,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:55:43,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:55:43,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:55:43,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:55:43,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:55:43,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:55:43,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:55:43,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:55:43,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:55:43,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:55:43,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:55:43,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:55:43,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:55:43,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:55:43,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:55:43,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:55:43,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:55:43,521 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-26 00:55:43,563 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:55:43,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:55:43,564 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:55:43,564 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:55:43,565 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:55:43,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:55:43,566 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:55:43,566 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:55:43,567 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:55:43,567 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:55:43,568 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:55:43,568 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:55:43,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:55:43,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:55:43,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:55:43,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:55:43,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:55:43,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:55:43,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:55:43,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:55:43,572 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:55:43,572 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:55:43,572 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:55:43,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:55:43,573 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:55:43,573 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:55:43,573 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:55:43,574 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:55:43,574 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:55:43,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:55:43,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:55:43,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:55:43,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:55:43,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:55:43,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:55:43,576 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:55:43,577 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:55:43,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:55:43,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:55:43,577 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_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2022-11-26 00:55:43,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:55:43,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:55:43,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:55:43,965 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:55:43,966 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:55:43,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2022-11-26 00:55:47,002 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:55:47,404 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:55:47,405 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2022-11-26 00:55:47,422 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data/abf50be59/033bd2865a9d4939bffd06f00ac99fa3/FLAGa096d635a [2022-11-26 00:55:47,448 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/data/abf50be59/033bd2865a9d4939bffd06f00ac99fa3 [2022-11-26 00:55:47,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:55:47,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:55:47,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:55:47,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:55:47,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:55:47,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:55:47" (1/1) ... [2022-11-26 00:55:47,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd8e9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:47, skipping insertion in model container [2022-11-26 00:55:47,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:55:47" (1/1) ... [2022-11-26 00:55:47,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:55:47,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:55:48,045 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2022-11-26 00:55:48,249 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:55:48,251 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2022-11-26 00:55:48,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:55:48,298 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-26 00:55:48,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:55:48,349 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2022-11-26 00:55:48,456 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:55:48,458 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2022-11-26 00:55:48,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:55:48,471 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:55:48,517 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2022-11-26 00:55:48,595 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:55:48,601 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2022-11-26 00:55:48,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:55:48,667 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:55:48,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48 WrapperNode [2022-11-26 00:55:48,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:55:48,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:55:48,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:55:48,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:55:48,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:48,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:48,843 INFO L138 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1570 [2022-11-26 00:55:48,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:55:48,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:55:48,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:55:48,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:55:48,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:48,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:48,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:48,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:48,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:49,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:49,010 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:49,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:49,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:55:49,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:55:49,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:55:49,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:55:49,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (1/1) ... [2022-11-26 00:55:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:55:49,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:49,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:55:49,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:55:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-26 00:55:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-26 00:55:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-26 00:55:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-26 00:55:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-26 00:55:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-26 00:55:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:55:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:55:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:55:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:55:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-26 00:55:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:55:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:55:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-26 00:55:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:55:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:55:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:55:49,387 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:55:49,389 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:55:49,393 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-26 00:55:56,593 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:55:56,609 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:55:56,609 INFO L300 CfgBuilder]: Removed 92 assume(true) statements. [2022-11-26 00:55:56,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:55:56 BoogieIcfgContainer [2022-11-26 00:55:56,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:55:56,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:55:56,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:55:56,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:55:56,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:55:47" (1/3) ... [2022-11-26 00:55:56,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa70be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:55:56, skipping insertion in model container [2022-11-26 00:55:56,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:55:48" (2/3) ... [2022-11-26 00:55:56,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa70be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:55:56, skipping insertion in model container [2022-11-26 00:55:56,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:55:56" (3/3) ... [2022-11-26 00:55:56,623 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-2.i [2022-11-26 00:55:56,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:55:56,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 834 error locations. [2022-11-26 00:55:56,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:55:56,743 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;@5ec80bc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:55:56,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 834 error locations. [2022-11-26 00:55:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 1653 states, 811 states have (on average 2.249075215782984) internal successors, (1824), 1644 states have internal predecessors, (1824), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:55:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:55:56,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:56,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:55:56,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:55:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-26 00:55:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:55:56,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451569841] [2022-11-26 00:55:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:56,787 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-26 00:55:56,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:55:56,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:55:56,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-26 00:55:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:56,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-26 00:55:56,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:57,014 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-26 00:55:57,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:55:57,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:55:57,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451569841] [2022-11-26 00:55:57,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451569841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:55:57,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:55:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:55:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239502402] [2022-11-26 00:55:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:55:57,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:55:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:55:57,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:55:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:55:57,056 INFO L87 Difference]: Start difference. First operand has 1653 states, 811 states have (on average 2.249075215782984) internal successors, (1824), 1644 states have internal predecessors, (1824), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) 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-26 00:55:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:57,138 INFO L93 Difference]: Finished difference Result 1635 states and 1727 transitions. [2022-11-26 00:55:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:55:57,156 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-26 00:55:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:57,190 INFO L225 Difference]: With dead ends: 1635 [2022-11-26 00:55:57,190 INFO L226 Difference]: Without dead ends: 1633 [2022-11-26 00:55:57,192 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-26 00:55:57,195 INFO L413 NwaCegarLoop]: 1727 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, 1727 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-26 00:55:57,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:55:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-26 00:55:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2022-11-26 00:55:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 802 states have (on average 2.123441396508728) internal successors, (1703), 1624 states have internal predecessors, (1703), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:55:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1725 transitions. [2022-11-26 00:55:57,336 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1725 transitions. Word has length 5 [2022-11-26 00:55:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:57,338 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 1725 transitions. [2022-11-26 00:55:57,346 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-26 00:55:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1725 transitions. [2022-11-26 00:55:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:55:57,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:57,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:55:57,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-26 00:55:57,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:55:57,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:55:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-26 00:55:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:55:57,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413804401] [2022-11-26 00:55:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:57,565 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-26 00:55:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:55:57,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:55:57,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-26 00:55:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:57,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:55:57,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:57,842 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-26 00:55:57,861 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-26 00:55:57,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:55:57,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:55:57,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413804401] [2022-11-26 00:55:57,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413804401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:55:57,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:55:57,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:55:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019206039] [2022-11-26 00:55:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:55:57,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:55:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:55:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:55:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:55:57,872 INFO L87 Difference]: Start difference. First operand 1633 states and 1725 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-26 00:56:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:01,508 INFO L93 Difference]: Finished difference Result 1889 states and 2024 transitions. [2022-11-26 00:56:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:01,508 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-26 00:56:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:01,516 INFO L225 Difference]: With dead ends: 1889 [2022-11-26 00:56:01,523 INFO L226 Difference]: Without dead ends: 1889 [2022-11-26 00:56:01,524 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-26 00:56:01,525 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1365 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:01,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1529 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-26 00:56:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-11-26 00:56:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1618. [2022-11-26 00:56:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 878 states have (on average 1.989749430523918) internal successors, (1747), 1609 states have internal predecessors, (1747), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1769 transitions. [2022-11-26 00:56:01,578 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1769 transitions. Word has length 5 [2022-11-26 00:56:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:01,579 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 1769 transitions. [2022-11-26 00:56:01,579 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-26 00:56:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1769 transitions. [2022-11-26 00:56:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:56:01,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:01,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:56:01,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:01,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-26 00:56:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461158554] [2022-11-26 00:56:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:01,800 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-26 00:56:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:01,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:01,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-26 00:56:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:01,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:56:01,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:01,973 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-26 00:56:01,993 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-26 00:56:01,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:01,994 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:01,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461158554] [2022-11-26 00:56:01,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461158554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:01,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:56:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855678887] [2022-11-26 00:56:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:01,996 INFO L87 Difference]: Start difference. First operand 1618 states and 1769 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-26 00:56:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:06,966 INFO L93 Difference]: Finished difference Result 2138 states and 2339 transitions. [2022-11-26 00:56:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:06,966 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-26 00:56:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:06,975 INFO L225 Difference]: With dead ends: 2138 [2022-11-26 00:56:06,975 INFO L226 Difference]: Without dead ends: 2138 [2022-11-26 00:56:06,976 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-26 00:56:06,977 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 741 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:06,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2260 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-26 00:56:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-11-26 00:56:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1774. [2022-11-26 00:56:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1044 states have (on average 1.9664750957854407) internal successors, (2053), 1765 states have internal predecessors, (2053), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2075 transitions. [2022-11-26 00:56:07,039 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2075 transitions. Word has length 5 [2022-11-26 00:56:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:07,040 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 2075 transitions. [2022-11-26 00:56:07,040 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-26 00:56:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2075 transitions. [2022-11-26 00:56:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:56:07,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:07,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:56:07,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-26 00:56:07,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:07,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-26 00:56:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:07,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040908852] [2022-11-26 00:56:07,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56: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-26 00:56:07,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:07,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:07,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-26 00:56:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:07,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:56:07,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:07,409 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-26 00:56:07,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:07,410 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:07,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040908852] [2022-11-26 00:56:07,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040908852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:07,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:07,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022842814] [2022-11-26 00:56:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:07,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:07,433 INFO L87 Difference]: Start difference. First operand 1774 states and 2075 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-26 00:56:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:07,613 INFO L93 Difference]: Finished difference Result 3332 states and 3923 transitions. [2022-11-26 00:56:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:07,617 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-26 00:56:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:07,629 INFO L225 Difference]: With dead ends: 3332 [2022-11-26 00:56:07,630 INFO L226 Difference]: Without dead ends: 3332 [2022-11-26 00:56:07,630 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-26 00:56:07,631 INFO L413 NwaCegarLoop]: 1903 mSDtfsCounter, 1373 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:07,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 3517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2022-11-26 00:56:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 1776. [2022-11-26 00:56:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1046 states have (on average 1.9646271510516253) internal successors, (2055), 1767 states have internal predecessors, (2055), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2077 transitions. [2022-11-26 00:56:07,688 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2077 transitions. Word has length 6 [2022-11-26 00:56:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:07,689 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 2077 transitions. [2022-11-26 00:56:07,689 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-26 00:56:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2077 transitions. [2022-11-26 00:56:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:56:07,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:07,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:07,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:07,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:07,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-26 00:56:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:07,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487506131] [2022-11-26 00:56:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:07,907 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-26 00:56:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:07,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:07,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-26 00:56:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:08,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:56:08,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:08,107 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-26 00:56:08,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:08,107 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:08,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487506131] [2022-11-26 00:56:08,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487506131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:08,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:08,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460368070] [2022-11-26 00:56:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:08,109 INFO L87 Difference]: Start difference. First operand 1776 states and 2077 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-26 00:56:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:08,152 INFO L93 Difference]: Finished difference Result 1740 states and 2040 transitions. [2022-11-26 00:56:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:08,153 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-26 00:56:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:08,158 INFO L225 Difference]: With dead ends: 1740 [2022-11-26 00:56:08,158 INFO L226 Difference]: Without dead ends: 1740 [2022-11-26 00:56:08,159 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-26 00:56:08,159 INFO L413 NwaCegarLoop]: 1576 mSDtfsCounter, 1546 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1604 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-26 00:56:08,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1604 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:56:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2022-11-26 00:56:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1734. [2022-11-26 00:56:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1028 states have (on average 1.9571984435797665) internal successors, (2012), 1725 states have internal predecessors, (2012), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2034 transitions. [2022-11-26 00:56:08,216 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2034 transitions. Word has length 11 [2022-11-26 00:56:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:08,216 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 2034 transitions. [2022-11-26 00:56:08,216 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-26 00:56:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2034 transitions. [2022-11-26 00:56:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:56:08,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:08,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:08,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:08,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:08,429 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-26 00:56:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:08,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455546896] [2022-11-26 00:56:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:08,430 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-26 00:56:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:08,431 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:08,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-26 00:56:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:08,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:08,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:08,641 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-26 00:56:08,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:08,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:08,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455546896] [2022-11-26 00:56:08,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455546896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:08,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:08,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650409831] [2022-11-26 00:56:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:08,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:08,644 INFO L87 Difference]: Start difference. First operand 1734 states and 2034 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-26 00:56:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:08,740 INFO L93 Difference]: Finished difference Result 1719 states and 2012 transitions. [2022-11-26 00:56:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:56:08,741 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-26 00:56:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:08,746 INFO L225 Difference]: With dead ends: 1719 [2022-11-26 00:56:08,747 INFO L226 Difference]: Without dead ends: 1719 [2022-11-26 00:56:08,747 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-26 00:56:08,748 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 1527 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 3083 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-26 00:56:08,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 3083 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2022-11-26 00:56:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1712. [2022-11-26 00:56:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1020 states have (on average 1.9441176470588235) internal successors, (1983), 1703 states have internal predecessors, (1983), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2005 transitions. [2022-11-26 00:56:08,782 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2005 transitions. Word has length 13 [2022-11-26 00:56:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:08,783 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2005 transitions. [2022-11-26 00:56:08,783 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-26 00:56:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2005 transitions. [2022-11-26 00:56:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:56:08,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:08,784 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-26 00:56:08,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:08,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:08,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-26 00:56:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:08,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531251485] [2022-11-26 00:56:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:08,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:09,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-26 00:56:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:09,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:56:09,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:09,196 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-26 00:56:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:09,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:09,276 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531251485] [2022-11-26 00:56:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531251485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:09,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:09,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011692185] [2022-11-26 00:56:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:09,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:09,278 INFO L87 Difference]: Start difference. First operand 1712 states and 2005 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-26 00:56:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:14,476 INFO L93 Difference]: Finished difference Result 2756 states and 3086 transitions. [2022-11-26 00:56:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:14,476 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-26 00:56:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:14,485 INFO L225 Difference]: With dead ends: 2756 [2022-11-26 00:56:14,486 INFO L226 Difference]: Without dead ends: 2756 [2022-11-26 00:56:14,486 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-26 00:56:14,487 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 3196 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3204 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:14,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3204 Valid, 1880 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-26 00:56:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2022-11-26 00:56:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 1708. [2022-11-26 00:56:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1020 states have (on average 1.9401960784313725) internal successors, (1979), 1699 states have internal predecessors, (1979), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2001 transitions. [2022-11-26 00:56:14,526 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2001 transitions. Word has length 27 [2022-11-26 00:56:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:14,527 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 2001 transitions. [2022-11-26 00:56:14,527 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-26 00:56:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2001 transitions. [2022-11-26 00:56:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:56:14,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:14,528 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-26 00:56:14,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:14,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-26 00:56:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865853330] [2022-11-26 00:56:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:14,748 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-26 00:56:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:14,750 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:14,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-26 00:56:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:14,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:56:14,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:14,990 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-26 00:56:15,205 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-26 00:56:15,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:15,206 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865853330] [2022-11-26 00:56:15,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865853330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:15,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:15,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641670569] [2022-11-26 00:56:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:15,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:15,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:15,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:15,208 INFO L87 Difference]: Start difference. First operand 1708 states and 2001 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-26 00:56:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:21,484 INFO L93 Difference]: Finished difference Result 2276 states and 2479 transitions. [2022-11-26 00:56:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:21,484 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-26 00:56:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:21,490 INFO L225 Difference]: With dead ends: 2276 [2022-11-26 00:56:21,491 INFO L226 Difference]: Without dead ends: 2276 [2022-11-26 00:56:21,491 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-26 00:56:21,491 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1501 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:21,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 2591 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-26 00:56:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2022-11-26 00:56:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1704. [2022-11-26 00:56:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1020 states have (on average 1.9362745098039216) internal successors, (1975), 1695 states have internal predecessors, (1975), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1997 transitions. [2022-11-26 00:56:21,524 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1997 transitions. Word has length 27 [2022-11-26 00:56:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:21,525 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 1997 transitions. [2022-11-26 00:56:21,525 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-26 00:56:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1997 transitions. [2022-11-26 00:56:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-26 00:56:21,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:21,526 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-26 00:56:21,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:21,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:21,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-26 00:56:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:21,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066428002] [2022-11-26 00:56:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:21,739 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-26 00:56:21,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:21,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:21,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-26 00:56:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:21,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:22,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:22,053 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-26 00:56:22,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:22,054 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:22,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066428002] [2022-11-26 00:56:22,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066428002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:22,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:22,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:22,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41767022] [2022-11-26 00:56:22,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:22,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:22,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:22,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:22,056 INFO L87 Difference]: Start difference. First operand 1704 states and 1997 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-26 00:56:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:22,125 INFO L93 Difference]: Finished difference Result 1704 states and 1993 transitions. [2022-11-26 00:56:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:56:22,126 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-26 00:56:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:22,131 INFO L225 Difference]: With dead ends: 1704 [2022-11-26 00:56:22,132 INFO L226 Difference]: Without dead ends: 1704 [2022-11-26 00:56:22,132 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-26 00:56:22,133 INFO L413 NwaCegarLoop]: 1525 mSDtfsCounter, 1496 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 3061 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-26 00:56:22,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 3061 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:56:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2022-11-26 00:56:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1698. [2022-11-26 00:56:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1014 states have (on average 1.9378698224852071) internal successors, (1965), 1689 states have internal predecessors, (1965), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 1987 transitions. [2022-11-26 00:56:22,160 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 1987 transitions. Word has length 42 [2022-11-26 00:56:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:22,161 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 1987 transitions. [2022-11-26 00:56:22,161 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-26 00:56:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 1987 transitions. [2022-11-26 00:56:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-26 00:56:22,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:22,162 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-26 00:56:22,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:22,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:22,375 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-26 00:56:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:22,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881920288] [2022-11-26 00:56:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:22,377 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-26 00:56:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:22,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:22,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-26 00:56:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:22,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:22,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:22,912 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-26 00:56:22,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:22,913 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:22,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881920288] [2022-11-26 00:56:22,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881920288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:22,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:22,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977856544] [2022-11-26 00:56:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:22,915 INFO L87 Difference]: Start difference. First operand 1698 states and 1987 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-26 00:56:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:23,161 INFO L93 Difference]: Finished difference Result 1939 states and 2237 transitions. [2022-11-26 00:56:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:23,162 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-26 00:56:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:23,168 INFO L225 Difference]: With dead ends: 1939 [2022-11-26 00:56:23,168 INFO L226 Difference]: Without dead ends: 1939 [2022-11-26 00:56:23,168 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-26 00:56:23,169 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 269 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:23,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 3004 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:56:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-11-26 00:56:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1744. [2022-11-26 00:56:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1060 states have (on average 1.8971698113207547) internal successors, (2011), 1735 states have internal predecessors, (2011), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2033 transitions. [2022-11-26 00:56:23,198 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2033 transitions. Word has length 50 [2022-11-26 00:56:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:23,199 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 2033 transitions. [2022-11-26 00:56:23,199 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-26 00:56:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2033 transitions. [2022-11-26 00:56:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-26 00:56:23,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:23,200 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-26 00:56:23,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:23,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:23,414 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-26 00:56:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:23,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756190781] [2022-11-26 00:56:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:23,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-26 00:56:23,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:23,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:23,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-26 00:56:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:23,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:56:23,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:23,885 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-26 00:56:23,895 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-26 00:56:24,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:24,390 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-26 00:56:24,406 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:56:24,406 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-26 00:56:24,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-26 00:56:24,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:24,431 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:24,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756190781] [2022-11-26 00:56:24,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756190781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:24,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:24,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246441114] [2022-11-26 00:56:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:24,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:24,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:24,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:24,433 INFO L87 Difference]: Start difference. First operand 1744 states and 2033 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-26 00:56:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:28,832 INFO L93 Difference]: Finished difference Result 1931 states and 2204 transitions. [2022-11-26 00:56:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:56:28,832 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-26 00:56:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:28,840 INFO L225 Difference]: With dead ends: 1931 [2022-11-26 00:56:28,840 INFO L226 Difference]: Without dead ends: 1931 [2022-11-26 00:56:28,840 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-26 00:56:28,841 INFO L413 NwaCegarLoop]: 627 mSDtfsCounter, 2660 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 920 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-26 00:56:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-11-26 00:56:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1494. [2022-11-26 00:56:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 894 states have (on average 1.8008948545861299) internal successors, (1610), 1485 states have internal predecessors, (1610), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1632 transitions. [2022-11-26 00:56:28,865 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1632 transitions. Word has length 53 [2022-11-26 00:56:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:28,865 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 1632 transitions. [2022-11-26 00:56:28,866 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-26 00:56:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1632 transitions. [2022-11-26 00:56:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:56:28,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:28,867 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-26 00:56:28,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:29,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-26 00:56:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:29,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472677309] [2022-11-26 00:56:29,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:29,084 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:29,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-26 00:56:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:29,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:56:29,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:29,428 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-26 00:56:29,451 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-26 00:56:29,490 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-26 00:56:29,502 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-26 00:56:29,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:29,503 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:29,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472677309] [2022-11-26 00:56:29,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472677309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:29,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:29,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205507653] [2022-11-26 00:56:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:29,505 INFO L87 Difference]: Start difference. First operand 1494 states and 1632 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-26 00:56:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:33,990 INFO L93 Difference]: Finished difference Result 1493 states and 1631 transitions. [2022-11-26 00:56:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:56:33,990 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-26 00:56:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:33,996 INFO L225 Difference]: With dead ends: 1493 [2022-11-26 00:56:33,996 INFO L226 Difference]: Without dead ends: 1493 [2022-11-26 00:56:33,996 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-26 00:56:33,997 INFO L413 NwaCegarLoop]: 1445 mSDtfsCounter, 4 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:33,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3688 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-26 00:56:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2022-11-26 00:56:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2022-11-26 00:56:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 894 states have (on average 1.7997762863534676) internal successors, (1609), 1484 states have internal predecessors, (1609), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1631 transitions. [2022-11-26 00:56:34,030 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1631 transitions. Word has length 58 [2022-11-26 00:56:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:34,031 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1631 transitions. [2022-11-26 00:56:34,031 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-26 00:56:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1631 transitions. [2022-11-26 00:56:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:56:34,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:34,032 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-26 00:56:34,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:34,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:34,247 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-26 00:56:34,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:34,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601508633] [2022-11-26 00:56:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:34,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-26 00:56:34,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:34,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:34,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-26 00:56:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:34,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:56:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:34,576 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-26 00:56:34,603 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-26 00:56:34,615 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-26 00:56:34,674 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-26 00:56:34,683 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-26 00:56:34,701 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-26 00:56:34,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:34,701 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:34,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601508633] [2022-11-26 00:56:34,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601508633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:34,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:34,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574756918] [2022-11-26 00:56:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:34,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:34,703 INFO L87 Difference]: Start difference. First operand 1493 states and 1631 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-26 00:56:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:40,658 INFO L93 Difference]: Finished difference Result 1492 states and 1630 transitions. [2022-11-26 00:56:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:56:40,659 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-26 00:56:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:40,664 INFO L225 Difference]: With dead ends: 1492 [2022-11-26 00:56:40,664 INFO L226 Difference]: Without dead ends: 1492 [2022-11-26 00:56:40,664 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-26 00:56:40,665 INFO L413 NwaCegarLoop]: 1445 mSDtfsCounter, 2 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:40,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3734 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-26 00:56:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-11-26 00:56:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2022-11-26 00:56:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 893 states have (on average 1.8006718924972005) internal successors, (1608), 1483 states have internal predecessors, (1608), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:56:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1630 transitions. [2022-11-26 00:56:40,686 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1630 transitions. Word has length 58 [2022-11-26 00:56:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:40,686 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 1630 transitions. [2022-11-26 00:56:40,687 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-26 00:56:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1630 transitions. [2022-11-26 00:56:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-26 00:56:40,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:40,688 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-26 00:56:40,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:40,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:40,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2065621890, now seen corresponding path program 1 times [2022-11-26 00:56:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:40,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210536303] [2022-11-26 00:56:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:40,903 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-26 00:56:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:40,905 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:40,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-26 00:56:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:41,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:41,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:41,302 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-26 00:56:41,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:41,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210536303] [2022-11-26 00:56:41,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210536303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:41,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:41,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327642777] [2022-11-26 00:56:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:41,307 INFO L87 Difference]: Start difference. First operand 1492 states and 1630 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-26 00:56:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:41,382 INFO L93 Difference]: Finished difference Result 1495 states and 1635 transitions. [2022-11-26 00:56:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:56:41,382 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-26 00:56:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:41,390 INFO L225 Difference]: With dead ends: 1495 [2022-11-26 00:56:41,391 INFO L226 Difference]: Without dead ends: 1495 [2022-11-26 00:56:41,391 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-26 00:56:41,392 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 2 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4324 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:41,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4324 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:56:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-11-26 00:56:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2022-11-26 00:56:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 895 states have (on average 1.8) internal successors, (1611), 1486 states have internal predecessors, (1611), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 00:56:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1635 transitions. [2022-11-26 00:56:41,424 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1635 transitions. Word has length 66 [2022-11-26 00:56:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:41,424 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 1635 transitions. [2022-11-26 00:56:41,425 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-26 00:56:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1635 transitions. [2022-11-26 00:56:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 00:56:41,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:41,426 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-26 00:56:41,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:41,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:56:41,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash 611814351, now seen corresponding path program 1 times [2022-11-26 00:56:41,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:41,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181788011] [2022-11-26 00:56:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:41,641 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-26 00:56:41,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:41,642 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:41,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-26 00:56:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:41,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:56:42,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:42,035 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-26 00:56:42,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:42,131 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-26 00:56:42,131 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:42,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181788011] [2022-11-26 00:56:42,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181788011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:42,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1002265817] [2022-11-26 00:56:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:42,132 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:56:42,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:56:42,138 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:56:42,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-26 00:56:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:42,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:56:42,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:42,719 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-26 00:56:42,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:42,774 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-26 00:56:42,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1002265817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:42,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044836094] [2022-11-26 00:56:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:42,778 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:42,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 00:56:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:43,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:56:43,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:43,122 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-26 00:56:43,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:43,170 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-26 00:56:43,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044836094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:43,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:56:43,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-26 00:56:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542056841] [2022-11-26 00:56:43,171 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:56:43,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:56:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:43,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:56:43,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:56:43,174 INFO L87 Difference]: Start difference. First operand 1495 states and 1635 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-26 00:56:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:43,426 INFO L93 Difference]: Finished difference Result 1507 states and 1653 transitions. [2022-11-26 00:56:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:56:43,427 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-26 00:56:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:43,431 INFO L225 Difference]: With dead ends: 1507 [2022-11-26 00:56:43,431 INFO L226 Difference]: Without dead ends: 1507 [2022-11-26 00:56:43,431 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-26 00:56:43,432 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 12 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:43,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4326 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:56:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-11-26 00:56:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1505. [2022-11-26 00:56:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 904 states have (on average 1.7986725663716814) internal successors, (1626), 1495 states have internal predecessors, (1626), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 00:56:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1650 transitions. [2022-11-26 00:56:43,455 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1650 transitions. Word has length 67 [2022-11-26 00:56:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:43,456 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 1650 transitions. [2022-11-26 00:56:43,456 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-26 00:56:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1650 transitions. [2022-11-26 00:56:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-26 00:56:43,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:43,457 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-26 00:56:43,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:43,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:43,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:44,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:44,071 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:56:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -290789186, now seen corresponding path program 2 times [2022-11-26 00:56:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:56:44,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992046585] [2022-11-26 00:56:44,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:56:44,073 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-26 00:56:44,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:56:44,074 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:56:44,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-26 00:56:44,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:56:44,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:56:44,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:56:44,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:44,634 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-26 00:56:44,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:44,886 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-26 00:56:44,887 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:56:44,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992046585] [2022-11-26 00:56:44,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992046585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:44,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1240402046] [2022-11-26 00:56:44,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:56:44,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:56:44,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:56:44,892 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:56:44,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-26 00:56:46,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:56:46,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:56:46,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:56:46,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:46,417 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-26 00:56:46,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:46,509 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-26 00:56:46,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1240402046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:46,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780344912] [2022-11-26 00:56:46,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:56:46,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:46,511 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:46,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 00:56:55,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:56:55,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:56:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-26 00:56:55,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:55,308 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:56:55,309 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-26 00:56:55,345 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-26 00:56:55,862 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:56:55,863 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-26 00:56:55,962 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-26 00:56:56,001 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-26 00:56:56,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:56,146 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:56:56,147 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-26 00:56:56,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-26 00:56:56,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780344912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:56,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-26 00:56:56,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-26 00:56:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529126091] [2022-11-26 00:56:56,160 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-26 00:56:56,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-26 00:56:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:56:56,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-26 00:56:56,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-26 00:56:56,162 INFO L87 Difference]: Start difference. First operand 1505 states and 1650 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-26 00:57:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:13,208 INFO L93 Difference]: Finished difference Result 1796 states and 1937 transitions. [2022-11-26 00:57:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-26 00:57:13,209 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-26 00:57:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:13,214 INFO L225 Difference]: With dead ends: 1796 [2022-11-26 00:57:13,214 INFO L226 Difference]: Without dead ends: 1792 [2022-11-26 00:57:13,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-11-26 00:57:13,215 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 2748 mSDsluCounter, 8581 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 105 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 9431 SdHoareTripleChecker+Invalid, 7903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:13,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2753 Valid, 9431 Invalid, 7903 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 7791 Invalid, 7 Unknown, 0 Unchecked, 15.3s Time] [2022-11-26 00:57:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2022-11-26 00:57:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1513. [2022-11-26 00:57:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 913 states have (on average 1.7929901423877328) internal successors, (1637), 1503 states have internal predecessors, (1637), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 00:57:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1661 transitions. [2022-11-26 00:57:13,243 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1661 transitions. Word has length 70 [2022-11-26 00:57:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:13,243 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 1661 transitions. [2022-11-26 00:57:13,243 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-26 00:57:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1661 transitions. [2022-11-26 00:57:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-26 00:57:13,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:13,244 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:13,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:13,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:13,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:57:13,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:57:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1980129055, now seen corresponding path program 1 times [2022-11-26 00:57:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:57:13,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634844055] [2022-11-26 00:57:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:13,853 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-26 00:57:13,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:57:13,854 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:57:13,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-26 00:57:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:14,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 00:57:14,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:14,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:15,099 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:57:15,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634844055] [2022-11-26 00:57:15,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634844055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:15,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701781573] [2022-11-26 00:57:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:15,100 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:57:15,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:57:15,107 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:57:15,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-26 00:57:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:15,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 00:57:15,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:15,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:16,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1701781573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:16,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981290646] [2022-11-26 00:57:16,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:16,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:57:16,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:57:16,047 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:57:16,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-26 00:57:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:57:16,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:16,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:17,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981290646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:17,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:57:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-26 00:57:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920364090] [2022-11-26 00:57:17,653 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:57:17,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:57:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:57:17,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:57:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-26 00:57:17,656 INFO L87 Difference]: Start difference. First operand 1513 states and 1661 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:57:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:22,033 INFO L93 Difference]: Finished difference Result 1555 states and 1727 transitions. [2022-11-26 00:57:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-26 00:57:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-11-26 00:57:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:22,038 INFO L225 Difference]: With dead ends: 1555 [2022-11-26 00:57:22,038 INFO L226 Difference]: Without dead ends: 1549 [2022-11-26 00:57:22,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-26 00:57:22,040 INFO L413 NwaCegarLoop]: 1450 mSDtfsCounter, 51 mSDsluCounter, 23069 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 24519 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:22,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 24519 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 00:57:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2022-11-26 00:57:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1531. [2022-11-26 00:57:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 931 states have (on average 1.7830290010741139) internal successors, (1660), 1521 states have internal predecessors, (1660), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 00:57:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1684 transitions. [2022-11-26 00:57:22,068 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1684 transitions. Word has length 76 [2022-11-26 00:57:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:22,068 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 1684 transitions. [2022-11-26 00:57:22,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:57:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1684 transitions. [2022-11-26 00:57:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-26 00:57:22,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:22,069 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:22,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:22,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:22,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:22,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:57:22,687 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:57:22,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -272337953, now seen corresponding path program 2 times [2022-11-26 00:57:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:57:22,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710622487] [2022-11-26 00:57:22,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:57:22,689 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-26 00:57:22,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:57:22,690 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:57:22,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-26 00:57:23,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:57:23,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:57:23,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-26 00:57:23,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:24,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:28,108 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:57:28,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710622487] [2022-11-26 00:57:28,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710622487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:28,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [853979553] [2022-11-26 00:57:28,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:57:28,109 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:57:28,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:57:28,111 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:57:28,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-26 00:57:29,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:57:29,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:57:29,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-26 00:57:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:30,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:31,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [853979553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:31,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478627060] [2022-11-26 00:57:31,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:57:31,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:57:31,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:57:31,343 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:57:31,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-26 00:57:42,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:57:42,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:57:42,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-26 00:57:42,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:42,993 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:57:42,993 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-26 00:57:43,001 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-26 00:57:43,142 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-26 00:57:43,155 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-26 00:57:43,555 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-26 00:57:43,561 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-26 00:57:43,762 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:57:43,946 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_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:57:44,288 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-26 00:57:44,303 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_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436)))) is different from true [2022-11-26 00:57:44,320 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2437) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2438))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-26 00:57:44,335 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-26 00:57:44,350 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_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:57:44,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447)))) is different from true [2022-11-26 00:57:44,693 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_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449)))) is different from true [2022-11-26 00:57:44,710 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_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:57:44,723 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-26 00:57:44,736 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_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-11-26 00:57:44,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-11-26 00:57:44,760 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:57:44,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:57:44,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-11-26 00:57:44,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:57:44,843 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:57:44,843 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-26 00:57:44,849 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-26 00:57:45,058 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-26 00:57:45,067 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-26 00:57:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 238 not checked. [2022-11-26 00:57:45,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:46,160 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:57:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478627060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:57:46,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-26 00:57:46,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 26] total 75 [2022-11-26 00:57:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570636043] [2022-11-26 00:57:46,166 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-26 00:57:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-26 00:57:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:57:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-26 00:57:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2843, Unknown=37, NotChecked=2394, Total=6006 [2022-11-26 00:57:46,171 INFO L87 Difference]: Start difference. First operand 1531 states and 1684 transitions. Second operand has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 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-26 00:57:58,430 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (bvult (bvadd (_ bv7 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse6 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv19 32)) |c_#Ultimate.C_memset_#amount|)) (.cse9 (bvult (bvadd (_ bv15 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse13 (bvult (bvadd (_ bv14 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse5 (bvult (bvadd (_ bv18 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse3 (bvult (bvadd (_ bv6 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse17 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|)) (.cse15 (bvult (bvadd (_ bv13 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse11 (bvult (bvadd (_ bv10 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse19 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv12 32)) |c_#Ultimate.C_memset_#amount|)) (.cse20 (bvult (bvadd (_ bv11 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse16 (bvult (bvadd (_ bv17 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse8 (bvult (bvadd (_ bv16 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse14 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse7 (bvult |c_#Ultimate.C_memset_#t~loopctr360| |c_#Ultimate.C_memset_#amount|)) (.cse18 (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse1 (bvult (bvadd (_ bv3 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse12 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv9 32)) |c_#Ultimate.C_memset_#amount|)) (.cse10 (bvult (bvadd (_ bv8 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))))) (and (or .cse0 (not (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv21 32)) |c_#Ultimate.C_memset_#amount|)) (bvult (bvadd (_ bv22 32) |c_#Ultimate.C_memset_#t~loopctr360|) |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (or .cse0 .cse1 (not .cse2)) (or (not .cse3) .cse0 .cse4) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))) (or (not .cse5) .cse0 .cse6) (or .cse0 .cse7) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (or .cse0 .cse8 (not .cse9)) (or .cse0 .cse10 (not .cse4)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2437) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (or (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr360| (_ bv20 32)) |c_#Ultimate.C_memset_#amount|) (not .cse6) .cse0) (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2438))) (or .cse0 .cse11 (not .cse12)) (or (not .cse13) .cse0 .cse9) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (or (not .cse14) .cse0 .cse2) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (or (not .cse15) .cse0 .cse13) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450) |c_#memory_$Pointer$.base|)) (or .cse0 .cse5 (not .cse16)) (or .cse0 .cse3 (not .cse17)) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455))) (or .cse0 (not .cse18) .cse17) (or (not .cse19) .cse0 .cse15) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (or .cse0 .cse20 (not .cse11)) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|)) (or .cse19 .cse0 (not .cse20)) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (or .cse16 .cse0 (not .cse8)) (or .cse0 .cse14 (not .cse7)) (or .cse18 (not .cse1) .cse0) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|)) (or .cse12 (not .cse10) .cse0) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))))) is different from true [2022-11-26 00:58:00,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:58:01,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465) |c_#memory_$Pointer$.offset|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:59:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:59:42,450 INFO L93 Difference]: Finished difference Result 1947 states and 2182 transitions. [2022-11-26 00:59:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-11-26 00:59:42,451 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2022-11-26 00:59:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:59:42,456 INFO L225 Difference]: With dead ends: 1947 [2022-11-26 00:59:42,457 INFO L226 Difference]: Without dead ends: 1928 [2022-11-26 00:59:42,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 351 SyntacticMatches, 16 SemanticMatches, 183 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 7516 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=5735, Invalid=20869, Unknown=212, NotChecked=7224, Total=34040 [2022-11-26 00:59:42,464 INFO L413 NwaCegarLoop]: 872 mSDtfsCounter, 2892 mSDsluCounter, 23600 mSDsCounter, 0 mSdLazyCounter, 24202 mSolverCounterSat, 324 mSolverCounterUnsat, 545 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 24472 SdHoareTripleChecker+Invalid, 52737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 24202 IncrementalHoareTripleChecker+Invalid, 545 IncrementalHoareTripleChecker+Unknown, 27666 IncrementalHoareTripleChecker+Unchecked, 56.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:59:42,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 24472 Invalid, 52737 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [324 Valid, 24202 Invalid, 545 Unknown, 27666 Unchecked, 56.6s Time] [2022-11-26 00:59:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-11-26 00:59:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1617. [2022-11-26 00:59:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1017 states have (on average 1.7295968534906587) internal successors, (1759), 1606 states have internal predecessors, (1759), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 00:59:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1783 transitions. [2022-11-26 00:59:42,499 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1783 transitions. Word has length 88 [2022-11-26 00:59:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:59:42,499 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 1783 transitions. [2022-11-26 00:59:42,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5405405405405403) internal successors, (188), 75 states have internal predecessors, (188), 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-26 00:59:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1783 transitions. [2022-11-26 00:59:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-26 00:59:42,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:59:42,501 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-26 00:59:42,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:42,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:42,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:43,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:59:43,127 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 00:59:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:59:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash 363295479, now seen corresponding path program 1 times [2022-11-26 00:59:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:59:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288045838] [2022-11-26 00:59:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:59:43,129 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-26 00:59:43,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:59:43,130 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:59:43,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-26 00:59:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:59:44,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-26 00:59:44,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:59:44,132 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-26 00:59:44,264 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:59:44,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:59:44,290 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-26 00:59:44,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:59:44,492 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879)))) is different from true [2022-11-26 00:59:45,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2897)))) is different from true [2022-11-26 00:59:45,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903)))) is different from true [2022-11-26 00:59:45,406 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:59:45,422 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:59:45,471 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-11-26 00:59:45,931 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:59:45,931 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-26 00:59:46,062 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:59:46,063 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-26 00:59:46,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 33 treesize of output 15 [2022-11-26 00:59:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-26 00:59:46,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:59:46,192 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:59:46,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2923) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:59:46,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2969))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:59:46,524 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:59:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288045838] [2022-11-26 00:59:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288045838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:59:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409445210] [2022-11-26 00:59:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:59:46,525 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:59:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:59:46,527 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:59:46,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-26 00:59:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:59:50,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-26 00:59:50,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:59:50,375 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-26 00:59:50,517 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:59:50,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:59:50,534 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-26 00:59:50,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:59:50,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3338)))) is different from true [2022-11-26 00:59:50,985 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3342)))) is different from true [2022-11-26 00:59:51,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3343)))) is different from true [2022-11-26 00:59:51,066 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3345)))) is different from true [2022-11-26 00:59:51,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3356)))) is different from true [2022-11-26 00:59:51,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3357)))) is different from true [2022-11-26 00:59:51,655 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3363)))) is different from true [2022-11-26 00:59:51,855 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3369) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 00:59:51,908 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3371)))) is different from true [2022-11-26 00:59:51,999 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3374)))) is different from true [2022-11-26 00:59:52,204 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:59:52,205 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-26 00:59:52,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:59:52,276 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-26 00:59:52,305 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-26 00:59:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 395 not checked. [2022-11-26 00:59:52,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:59:52,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3378) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:59:52,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1409445210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:59:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685487188] [2022-11-26 00:59:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:59:52,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:59:52,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:59:52,778 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:59:52,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-26 00:59:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:59:53,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-26 00:59:53,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:59:53,572 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:59:53,572 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-26 00:59:53,640 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-26 00:59:55,891 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:59:55,891 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-26 00:59:56,060 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:59:56,061 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-26 00:59:56,080 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-26 00:59:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-26 00:59:56,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:59:56,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:59:56,518 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-26 00:59:56,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-26 00:59:56,528 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3877))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-11-26 00:59:56,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685487188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:59:56,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:59:56,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 12] total 35 [2022-11-26 00:59:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422040246] [2022-11-26 00:59:56,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:59:56,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-26 00:59:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:59:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-26 00:59:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=463, Unknown=51, NotChecked=1430, Total=2070 [2022-11-26 00:59:56,533 INFO L87 Difference]: Start difference. First operand 1617 states and 1783 transitions. Second operand has 36 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 35 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:00:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:00:24,021 INFO L93 Difference]: Finished difference Result 1889 states and 2041 transitions. [2022-11-26 01:00:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 01:00:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 35 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-11-26 01:00:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:00:24,026 INFO L225 Difference]: With dead ends: 1889 [2022-11-26 01:00:24,026 INFO L226 Difference]: Without dead ends: 1889 [2022-11-26 01:00:24,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 196 SyntacticMatches, 119 SemanticMatches, 54 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=219, Invalid=929, Unknown=62, NotChecked=1870, Total=3080 [2022-11-26 01:00:24,028 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 2688 mSDsluCounter, 8864 mSDsCounter, 0 mSdLazyCounter, 8927 mSolverCounterSat, 54 mSolverCounterUnsat, 1473 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2693 SdHoareTripleChecker+Valid, 9713 SdHoareTripleChecker+Invalid, 39894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 8927 IncrementalHoareTripleChecker+Invalid, 1473 IncrementalHoareTripleChecker+Unknown, 29440 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:00:24,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2693 Valid, 9713 Invalid, 39894 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 8927 Invalid, 1473 Unknown, 29440 Unchecked, 26.6s Time] [2022-11-26 01:00:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-11-26 01:00:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1616. [2022-11-26 01:00:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1017 states have (on average 1.7286135693215339) internal successors, (1758), 1605 states have internal predecessors, (1758), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 01:00:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1782 transitions. [2022-11-26 01:00:24,052 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1782 transitions. Word has length 113 [2022-11-26 01:00:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:00:24,053 INFO L495 AbstractCegarLoop]: Abstraction has 1616 states and 1782 transitions. [2022-11-26 01:00:24,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 35 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:00:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1782 transitions. [2022-11-26 01:00:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-26 01:00:24,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:00:24,054 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-26 01:00:24,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-26 01:00:24,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-26 01:00:24,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-26 01:00:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 01:00:24,670 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 01:00:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:00:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash 363295480, now seen corresponding path program 1 times [2022-11-26 01:00:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:00:24,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069496647] [2022-11-26 01:00:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:00:24,671 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-26 01:00:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:00:24,672 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:00:24,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-26 01:00:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:00:25,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-26 01:00:25,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:00:25,659 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-26 01:00:25,775 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-26 01:00:25,797 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:00:25,797 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-26 01:00:25,828 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-26 01:00:25,859 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-26 01:00:25,979 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-26 01:00:25,984 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-26 01:00:26,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-11-26 01:00:26,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-26 01:00:26,067 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-26 01:00:26,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:26,131 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-11-26 01:00:26,143 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256)))) is different from true [2022-11-26 01:00:26,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,166 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:26,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263)))) is different from true [2022-11-26 01:00:26,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265)))) is different from true [2022-11-26 01:00:26,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268)))) is different from true [2022-11-26 01:00:26,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275)))) is different from true [2022-11-26 01:00:26,332 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276)))) is different from true [2022-11-26 01:00:26,379 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-26 01:00:26,459 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,473 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,554 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:26,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296)))) is different from true [2022-11-26 01:00:26,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299)))) is different from true [2022-11-26 01:00:26,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301)))) is different from true [2022-11-26 01:00:26,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,620 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4305))) (exists ((v_ArrVal_4304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4304)))) is different from true [2022-11-26 01:00:26,633 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4307))) (exists ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4306)))) is different from true [2022-11-26 01:00:26,646 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4309) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4308 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4308)))) is different from true [2022-11-26 01:00:26,659 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4311))) (exists ((v_ArrVal_4310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4310)))) is different from true [2022-11-26 01:00:26,673 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4312))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4313)))) is different from true [2022-11-26 01:00:26,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4315) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4314)))) is different from true [2022-11-26 01:00:26,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4316))) (exists ((v_ArrVal_4317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4317) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4318))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4319)))) is different from true [2022-11-26 01:00:26,730 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4321) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,743 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4322))) (exists ((v_ArrVal_4323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4323))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-26 01:00:26,757 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4325))) (exists ((v_ArrVal_4324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4324)))) is different from true [2022-11-26 01:00:26,771 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4327))) (exists ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4326) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:26,784 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4328)))) is different from true [2022-11-26 01:00:26,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4331) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:26,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:00:26,848 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-26 01:00:26,875 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-26 01:00:26,986 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:00:26,987 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-26 01:00:26,996 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-26 01:00:27,023 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-26 01:00:27,026 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-26 01:00:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 945 not checked. [2022-11-26 01:00:27,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:00:27,232 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (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_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-26 01:00:27,269 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_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 01:00:28,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425) .cse0 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (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_4425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-26 01:00:28,305 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:00:28,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069496647] [2022-11-26 01:00:28,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069496647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:00:28,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [344883347] [2022-11-26 01:00:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:00:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:00:28,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:00:28,311 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:00:28,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-26 01:00:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:00:32,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-26 01:00:32,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:00:32,796 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-26 01:00:32,803 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-26 01:00:33,258 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:00:33,259 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-26 01:00:33,273 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-26 01:00:33,346 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-26 01:00:33,358 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-26 01:00:33,468 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-26 01:00:33,527 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 7 treesize of output 3 [2022-11-26 01:00:33,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794)))) is different from true [2022-11-26 01:00:33,629 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795)))) is different from true [2022-11-26 01:00:36,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:00:36,555 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 16 treesize of output 18 [2022-11-26 01:00:36,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:00:36,785 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-26 01:00:36,807 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-26 01:00:36,807 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 60 treesize of output 44 [2022-11-26 01:00:36,942 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 15 [2022-11-26 01:00:36,946 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 26 treesize of output 14 [2022-11-26 01:00:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-26 01:00:37,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:00:37,426 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 231 treesize of output 159 [2022-11-26 01:00:42,523 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4839 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse1 (select |c_#length| v_arrayElimCell_60))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (bvule (bvadd (_ bv8 32) (select (select (store .cse2 v_arrayElimCell_60 (store (select .cse2 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse0) v_ArrVal_4839)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse1))))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_60 (store (select .cse5 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse6) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse4) (bvadd (_ bv8 32) .cse4)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_60))))))))) is different from false [2022-11-26 01:00:42,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [344883347] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:00:42,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819531648] [2022-11-26 01:00:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:00:42,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:00:42,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:00:42,540 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:00:42,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-26 01:00:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:00:43,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-26 01:00:43,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:00:43,451 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-26 01:00:43,464 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:00:43,464 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-26 01:00:43,477 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-26 01:00:43,489 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-26 01:00:43,555 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-26 01:00:43,560 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-26 01:00:43,612 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254)))) is different from true [2022-11-26 01:00:43,626 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:43,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:43,653 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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-26 01:00:43,668 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_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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)))) is different from true [2022-11-26 01:00:43,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:43,694 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:43,707 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268)))) is different from true [2022-11-26 01:00:43,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:43,736 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272)))) is different from true [2022-11-26 01:00:43,751 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273))) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:43,765 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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_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-26 01:00:43,780 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278)))) is different from true [2022-11-26 01:00:43,794 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-26 01:00:43,812 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282)))) is different from true [2022-11-26 01:00:43,826 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-26 01:00:43,840 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285)))) is different from true [2022-11-26 01:00:43,855 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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:43,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:43,879 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:43,892 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-11-26 01:00:43,904 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295))) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296)))) is different from true [2022-11-26 01:00:43,917 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297)))) is different from true [2022-11-26 01:00:43,930 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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:43,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-11-26 01:00:43,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:43,976 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (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_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-26 01:00:43,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-26 01:00:44,004 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:44,018 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-26 01:00:44,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314)))) is different from true [2022-11-26 01:00:44,048 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-26 01:00:44,063 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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:44,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:44,092 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_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ 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-26 01:00:44,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:00:44,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326)))) is different from true [2022-11-26 01:00:44,151 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327)))) is different from true [2022-11-26 01:00:44,165 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:44,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:00:44,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-11-26 01:00:44,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336)))) is different from true [2022-11-26 01:00:44,221 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338)))) is different from true [2022-11-26 01:00:44,236 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-11-26 01:00:44,289 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:00:44,289 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-26 01:00:44,300 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-26 01:00:44,385 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:00:44,386 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-26 01:00:44,393 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-26 01:00:44,427 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-26 01:00:44,431 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-26 01:00:44,438 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-26 01:00:44,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:00:44,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (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_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-26 01:00:44,538 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_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-26 01:00:45,530 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5341 (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_5434) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5433))) (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_5434) .cse2 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-26 01:00:45,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819531648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:00:45,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:00:45,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 13, 53] total 101 [2022-11-26 01:00:45,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77310735] [2022-11-26 01:00:45,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:00:45,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-11-26 01:00:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:00:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-11-26 01:00:45,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=581, Unknown=124, NotChecked=11704, Total=12656 [2022-11-26 01:00:45,547 INFO L87 Difference]: Start difference. First operand 1616 states and 1782 transitions. Second operand has 102 states, 99 states have (on average 2.515151515151515) internal successors, (249), 102 states have internal predecessors, (249), 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-26 01:00:47,643 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245)))) is different from true [2022-11-26 01:00:48,012 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-26 01:00:48,020 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (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_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (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_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-26 01:00:48,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (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_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |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_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301))) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-26 01:00:48,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301))) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-26 01:00:48,045 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4305))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4304))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-26 01:00:48,055 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4307))) (exists ((v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4305))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4304))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286))) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4306))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4268))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281)))) is different from true [2022-11-26 01:01:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:31,532 INFO L93 Difference]: Finished difference Result 2456 states and 2657 transitions. [2022-11-26 01:01:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 01:01:31,533 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 99 states have (on average 2.515151515151515) internal successors, (249), 102 states have internal predecessors, (249), 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 113 [2022-11-26 01:01:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:31,538 INFO L225 Difference]: With dead ends: 2456 [2022-11-26 01:01:31,538 INFO L226 Difference]: Without dead ends: 2456 [2022-11-26 01:01:31,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 194 SyntacticMatches, 54 SemanticMatches, 134 ConstructedPredicates, 95 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=457, Invalid=1381, Unknown=182, NotChecked=16340, Total=18360 [2022-11-26 01:01:31,541 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 4669 mSDsluCounter, 6477 mSDsCounter, 0 mSdLazyCounter, 13875 mSolverCounterSat, 91 mSolverCounterUnsat, 1500 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4674 SdHoareTripleChecker+Valid, 7138 SdHoareTripleChecker+Invalid, 181916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 13875 IncrementalHoareTripleChecker+Invalid, 1500 IncrementalHoareTripleChecker+Unknown, 166450 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:31,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4674 Valid, 7138 Invalid, 181916 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [91 Valid, 13875 Invalid, 1500 Unknown, 166450 Unchecked, 43.4s Time] [2022-11-26 01:01:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2022-11-26 01:01:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 1615. [2022-11-26 01:01:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1017 states have (on average 1.727630285152409) internal successors, (1757), 1604 states have internal predecessors, (1757), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 01:01:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1781 transitions. [2022-11-26 01:01:31,619 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1781 transitions. Word has length 113 [2022-11-26 01:01:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:31,619 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 1781 transitions. [2022-11-26 01:01:31,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 99 states have (on average 2.515151515151515) internal successors, (249), 102 states have internal predecessors, (249), 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-26 01:01:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1781 transitions. [2022-11-26 01:01:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-26 01:01:31,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:31,627 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:31,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:31,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:32,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:32,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:01:32,239 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 01:01:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash -381691963, now seen corresponding path program 1 times [2022-11-26 01:01:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:01:32,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25978225] [2022-11-26 01:01:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:32,241 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-26 01:01:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:01:32,242 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:01:32,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-26 01:01:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:33,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-26 01:01:33,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:33,368 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-26 01:01:33,498 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 01:01:33,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 01:01:33,524 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-26 01:01:33,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 01:01:33,726 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814)))) is different from true [2022-11-26 01:01:33,819 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817)))) is different from true [2022-11-26 01:01:33,938 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:01:34,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-11-26 01:01:34,983 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-11-26 01:01:35,305 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:01:35,306 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-26 01:01:35,444 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:01:35,444 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-26 01:01:35,546 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:01:35,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-26 01:01:35,575 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-26 01:01:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-11-26 01:01:35,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:35,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5859) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-11-26 01:01:35,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 01:01:35,717 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5858))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 01:01:35,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5858))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 01:01:36,061 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5905))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5858)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 01:01:36,065 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:01:36,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25978225] [2022-11-26 01:01:36,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25978225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [582376096] [2022-11-26 01:01:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:36,066 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:01:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:01:36,067 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:01:36,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-26 01:02:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:02:02,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-26 01:02:02,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:02:02,136 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-26 01:02:02,277 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 01:02:02,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 01:02:02,295 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-26 01:02:02,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 01:02:02,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6288)))) is different from true [2022-11-26 01:02:02,579 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:02,918 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6299)))) is different from true [2022-11-26 01:02:03,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6306)))) is different from true [2022-11-26 01:02:03,342 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6311)))) is different from true [2022-11-26 01:02:03,513 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6316)))) is different from true [2022-11-26 01:02:03,807 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6324)))) is different from true [2022-11-26 01:02:04,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:04,028 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-26 01:02:04,115 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:04,115 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-26 01:02:04,175 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:04,175 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-26 01:02:04,205 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-26 01:02:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2022-11-26 01:02:04,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:02:06,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-26 01:02:06,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:02:06,353 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:02:06,690 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6376))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:02:06,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [582376096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:02:06,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202663030] [2022-11-26 01:02:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:02:06,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:02:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:02:06,696 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:02:06,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-26 01:02:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:02:07,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-26 01:02:07,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:02:07,668 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:02:07,669 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-26 01:02:07,708 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-26 01:02:07,883 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754))) is different from true [2022-11-26 01:02:07,889 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) is different from true [2022-11-26 01:02:07,896 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:07,903 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6757) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:07,911 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6758))) is different from true [2022-11-26 01:02:07,918 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6759))) is different from true [2022-11-26 01:02:07,925 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6760) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:07,932 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761))) is different from true [2022-11-26 01:02:07,939 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6762))) is different from true [2022-11-26 01:02:07,946 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6763) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:07,953 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) is different from true [2022-11-26 01:02:07,961 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:07,968 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766))) is different from true [2022-11-26 01:02:07,974 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:07,981 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768))) is different from true [2022-11-26 01:02:07,987 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769))) is different from true [2022-11-26 01:02:07,993 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,004 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771))) is different from true [2022-11-26 01:02:08,011 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772))) is different from true [2022-11-26 01:02:08,018 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773))) is different from true [2022-11-26 01:02:08,024 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774))) is different from true [2022-11-26 01:02:08,030 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,036 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,042 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6777))) is different from true [2022-11-26 01:02:08,049 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6778))) is different from true [2022-11-26 01:02:08,055 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6779) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,062 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6780) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,068 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6781))) is different from true [2022-11-26 01:02:08,074 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6782))) is different from true [2022-11-26 01:02:08,081 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) is different from true [2022-11-26 01:02:08,087 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6784))) is different from true [2022-11-26 01:02:08,093 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6785 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6785))) is different from true [2022-11-26 01:02:08,099 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) is different from true [2022-11-26 01:02:08,105 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,112 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6788) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,118 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) is different from true [2022-11-26 01:02:08,124 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790))) is different from true [2022-11-26 01:02:08,131 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,137 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792))) is different from true [2022-11-26 01:02:08,143 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) is different from true [2022-11-26 01:02:08,149 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,155 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795))) is different from true [2022-11-26 01:02:08,162 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6796))) is different from true [2022-11-26 01:02:08,168 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6797) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:02:08,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:08,197 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 23 treesize of output 26 [2022-11-26 01:02:08,293 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:08,293 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 23 treesize of output 26 [2022-11-26 01:02:08,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:08,399 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-26 01:02:08,506 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-26 01:02:08,510 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-26 01:02:08,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:02:08,541 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 01:02:08,541 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-26 01:02:08,549 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2022-11-26 01:02:08,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-26 01:02:08,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6798)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-26 01:02:08,593 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6798))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 01:02:08,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6845))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6798)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-26 01:02:08,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202663030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:02:08,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:02:08,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 55] total 75 [2022-11-26 01:02:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82873493] [2022-11-26 01:02:08,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:02:08,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-26 01:02:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:02:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-26 01:02:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=437, Unknown=92, NotChecked=7630, Total=8372 [2022-11-26 01:02:08,935 INFO L87 Difference]: Start difference. First operand 1615 states and 1781 transitions. Second operand has 76 states, 73 states have (on average 2.506849315068493) internal successors, (183), 76 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:02:10,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754)))) is different from true [2022-11-26 01:02:10,629 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6306))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6288))) (exists ((v_ArrVal_6299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6299))) (exists ((v_ArrVal_6316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6316))) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6311))) (exists ((v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6324))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:02:43,715 INFO L93 Difference]: Finished difference Result 2647 states and 2900 transitions. [2022-11-26 01:02:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-26 01:02:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 73 states have (on average 2.506849315068493) internal successors, (183), 76 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2022-11-26 01:02:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:02:43,722 INFO L225 Difference]: With dead ends: 2647 [2022-11-26 01:02:43,722 INFO L226 Difference]: Without dead ends: 2647 [2022-11-26 01:02:43,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 207 SyntacticMatches, 80 SemanticMatches, 101 ConstructedPredicates, 72 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=307, Invalid=808, Unknown=103, NotChecked=9288, Total=10506 [2022-11-26 01:02:43,724 INFO L413 NwaCegarLoop]: 907 mSDtfsCounter, 3164 mSDsluCounter, 9230 mSDsCounter, 0 mSdLazyCounter, 8778 mSolverCounterSat, 68 mSolverCounterUnsat, 2107 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3177 SdHoareTripleChecker+Valid, 10137 SdHoareTripleChecker+Invalid, 161733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 8778 IncrementalHoareTripleChecker+Invalid, 2107 IncrementalHoareTripleChecker+Unknown, 150780 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:02:43,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3177 Valid, 10137 Invalid, 161733 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [68 Valid, 8778 Invalid, 2107 Unknown, 150780 Unchecked, 33.6s Time] [2022-11-26 01:02:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2022-11-26 01:02:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1614. [2022-11-26 01:02:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1017 states have (on average 1.7266470009832842) internal successors, (1756), 1603 states have internal predecessors, (1756), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 01:02:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1780 transitions. [2022-11-26 01:02:43,752 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1780 transitions. Word has length 116 [2022-11-26 01:02:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:02:43,753 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1780 transitions. [2022-11-26 01:02:43,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 73 states have (on average 2.506849315068493) internal successors, (183), 76 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:02:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1780 transitions. [2022-11-26 01:02:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-26 01:02:43,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:02:43,755 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:02:43,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-11-26 01:02:43,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-26 01:02:44,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-26 01:02:44,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:02:44,372 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 01:02:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:02:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -381691962, now seen corresponding path program 1 times [2022-11-26 01:02:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:02:44,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539004127] [2022-11-26 01:02:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:02:44,373 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-26 01:02:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:02:44,375 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:02:44,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-26 01:02:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:02:45,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-26 01:02:45,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:02:45,644 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-26 01:02:45,992 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:02:45,992 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-26 01:02:46,002 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-26 01:02:46,029 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-26 01:02:46,040 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-26 01:02:46,195 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 18 treesize of output 10 [2022-11-26 01:02:46,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 01:02:46,426 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:46,439 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7238))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7237) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:46,526 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:46,576 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:46,589 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249)))) is different from true [2022-11-26 01:02:46,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253)))) is different from true [2022-11-26 01:02:46,652 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256))) (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:02:46,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7257)))) is different from true [2022-11-26 01:02:46,679 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7259) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7260)))) is different from true [2022-11-26 01:02:46,729 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263)))) is different from true [2022-11-26 01:02:46,743 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266)))) is different from true [2022-11-26 01:02:46,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269)))) is different from true [2022-11-26 01:02:46,841 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273))) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:46,891 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:02:46,966 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281)))) is different from true [2022-11-26 01:02:47,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:02:47,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292)))) is different from true [2022-11-26 01:02:47,222 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7294) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:02:47,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7295))) (exists ((v_ArrVal_7296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7296)))) is different from true [2022-11-26 01:02:47,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:47,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7301) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-26 01:02:47,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:47,328 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306)))) is different from true [2022-11-26 01:02:47,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307)))) is different from true [2022-11-26 01:02:47,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:02:47,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311)))) is different from true [2022-11-26 01:02:47,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313)))) is different from true [2022-11-26 01:02:47,439 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:47,440 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-26 01:02:47,446 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-26 01:02:47,583 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:47,584 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-26 01:02:47,594 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-26 01:02:47,732 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:02:47,732 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-26 01:02:47,742 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-26 01:02:47,779 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 25 treesize of output 13 [2022-11-26 01:02:47,788 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 15 treesize of output 7 [2022-11-26 01:02:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-11-26 01:02:47,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:02:48,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 01:02:48,113 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_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 01:02:48,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7315) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7316))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7315) .cse2 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-26 01:02:48,275 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_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7315) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7316))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7315) .cse3 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-26 01:02:50,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7410))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7316))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7409) .cse0 v_ArrVal_7315) .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7410))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7409) .cse6 v_ArrVal_7315) (select (select (store .cse7 .cse6 v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-26 01:02:50,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:02:50,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539004127] [2022-11-26 01:02:50,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539004127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:02:50,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1502741632] [2022-11-26 01:02:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:02:50,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:02:50,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:02:50,222 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:02:50,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-26 01:05:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:18,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-26 01:05:18,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:18,749 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-26 01:05:19,034 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-26 01:05:19,066 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:05:19,067 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-26 01:05:19,156 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-26 01:05:19,170 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-26 01:05:19,459 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-26 01:05:19,466 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-26 01:05:19,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792)))) is different from true [2022-11-26 01:05:19,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:19,610 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:19,635 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798)))) is different from true [2022-11-26 01:05:19,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:19,691 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802)))) is different from true [2022-11-26 01:05:19,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804)))) is different from true [2022-11-26 01:05:19,732 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807))) (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806)))) is different from true [2022-11-26 01:05:19,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808)))) is different from true [2022-11-26 01:05:19,788 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811)))) is different from true [2022-11-26 01:05:19,810 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812)))) is different from true [2022-11-26 01:05:19,832 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814)))) is different from true [2022-11-26 01:05:19,855 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:19,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819)))) is different from true [2022-11-26 01:05:19,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820)))) is different from true [2022-11-26 01:05:19,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7822))) (exists ((v_ArrVal_7823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7823)))) is different from true [2022-11-26 01:05:19,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7825) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:19,970 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7826) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7827) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:19,993 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7829))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7828)))) is different from true [2022-11-26 01:05:20,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7831))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:20,038 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7832))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7833)))) is different from true [2022-11-26 01:05:20,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7834) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7835)))) is different from true [2022-11-26 01:05:20,083 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7837)))) is different from true [2022-11-26 01:05:20,106 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7838))) (exists ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7839)))) is different from true [2022-11-26 01:05:20,127 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840)))) is different from true [2022-11-26 01:05:20,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842))) (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:20,171 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845)))) is different from true [2022-11-26 01:05:20,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847))) (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-26 01:05:20,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7848) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7849)))) is different from true [2022-11-26 01:05:20,238 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7850))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7851)))) is different from true [2022-11-26 01:05:20,260 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7852) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7853) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:20,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7855)))) is different from true [2022-11-26 01:05:20,309 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7857))) (exists ((v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7856)))) is different from true [2022-11-26 01:05:20,330 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7858))) (exists ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7859) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:20,352 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7861))) (exists ((v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7860)))) is different from true [2022-11-26 01:05:20,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7863) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7862) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:20,396 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7864) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7865)))) is different from true [2022-11-26 01:05:20,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7867))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7866) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:20,440 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7869))) (exists ((v_ArrVal_7868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7868)))) is different from true [2022-11-26 01:05:20,462 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7871))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:20,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7873) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7872)))) is different from true [2022-11-26 01:05:20,506 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7875) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7874)))) is different from true [2022-11-26 01:05:20,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7877))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7876) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:20,549 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7879) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:20,623 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:05:20,624 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-26 01:05:20,643 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-26 01:05:20,892 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:05:20,893 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-26 01:05:20,906 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-26 01:05:21,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:05:21,106 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-26 01:05:21,126 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-26 01:05:21,162 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-26 01:05:21,167 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-26 01:05:21,178 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-26 01:05:21,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:05:21,268 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-26 01:05:21,322 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_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-26 01:05:21,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7881) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7880))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7881) .cse2 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-26 01:05:21,489 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) .cse1 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2022-11-26 01:05:24,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7975))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7974) .cse1 v_ArrVal_7881) (select (select (store .cse2 .cse1 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7883))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7975))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7880))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7974) .cse4 v_ArrVal_7881) .cse5 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 01:05:24,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1502741632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:24,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993348550] [2022-11-26 01:05:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:24,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:24,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:24,781 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:05:24,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-26 01:05:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:25,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-26 01:05:25,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:25,988 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:05:25,989 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-26 01:05:26,001 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-26 01:05:26,015 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-26 01:05:26,029 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-26 01:05:26,138 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-26 01:05:26,146 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-26 01:05:26,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357)))) is different from true [2022-11-26 01:05:26,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359))) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:26,290 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360)))) is different from true [2022-11-26 01:05:26,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366)))) is different from true [2022-11-26 01:05:26,447 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371)))) is different from true [2022-11-26 01:05:26,492 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:26,521 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374)))) is different from true [2022-11-26 01:05:26,548 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,570 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_8378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8378) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381)))) is different from true [2022-11-26 01:05:26,613 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383)))) is different from true [2022-11-26 01:05:26,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8385))) (exists ((v_ArrVal_8384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8384) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:26,675 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,697 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:26,719 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,741 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:26,763 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397)))) is different from true [2022-11-26 01:05:26,807 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8398) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399)))) is different from true [2022-11-26 01:05:26,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401)))) is different from true [2022-11-26 01:05:26,851 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8402))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8403) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8404))) (exists ((v_ArrVal_8405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8405) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:26,896 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-26 01:05:26,918 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409)))) is different from true [2022-11-26 01:05:26,940 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411)))) is different from true [2022-11-26 01:05:26,988 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-26 01:05:27,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414)))) is different from true [2022-11-26 01:05:27,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8417))) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416)))) is different from true [2022-11-26 01:05:27,053 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8418))) (exists ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8419) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:27,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8421) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8420))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-26 01:05:27,097 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8423))) (exists ((v_ArrVal_8422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8422)))) is different from true [2022-11-26 01:05:27,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8425) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8424)))) is different from true [2022-11-26 01:05:27,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8426))) (exists ((v_ArrVal_8427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8427)))) is different from true [2022-11-26 01:05:27,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8428))) (exists ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8429)))) is different from true [2022-11-26 01:05:27,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8430))) (exists ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8431))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-11-26 01:05:27,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8433) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8432)))) is different from true [2022-11-26 01:05:27,229 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8434) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8435) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:27,251 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8436) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8437)))) is different from true [2022-11-26 01:05:27,274 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8438))) (exists ((v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8439)))) is different from true [2022-11-26 01:05:27,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8441))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8440) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:05:27,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8442)))) is different from true [2022-11-26 01:05:27,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:05:27,403 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-26 01:05:27,412 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-26 01:05:27,583 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:05:27,583 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-26 01:05:27,603 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-26 01:05:27,691 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:05:27,692 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-26 01:05:27,706 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-26 01:05:27,749 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-26 01:05:27,759 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-26 01:05:27,767 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-26 01:05:27,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:05:27,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 01:05:27,900 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_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 01:05:27,973 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8445) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8444))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8445) .cse2 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-26 01:05:28,030 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_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8445) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8444))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8445) .cse3 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-26 01:05:30,368 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8539))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8538) .cse1 v_ArrVal_8445) (select (select (store .cse2 .cse1 v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8447))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8539))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8444))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8538) .cse4 v_ArrVal_8445) .cse5 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 01:05:30,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993348550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:30,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:05:30,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 53, 53] total 130 [2022-11-26 01:05:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946693433] [2022-11-26 01:05:30,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:05:30,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-26 01:05:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:05:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-26 01:05:30,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=432, Unknown=143, NotChecked=20864, Total=21756 [2022-11-26 01:05:30,389 INFO L87 Difference]: Start difference. First operand 1614 states and 1780 transitions. Second operand has 131 states, 128 states have (on average 2.2578125) internal successors, (289), 131 states have internal predecessors, (289), 2 states have call successors, (2), 1 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-26 01:05:32,024 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-26 01:05:32,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278))) (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287))) (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359))) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244))) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269))) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:05:32,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265))) (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7238))) (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278))) (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287))) (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_ArrVal_7301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7301) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256))) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292))) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266))) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269))) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:06:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:10,541 INFO L93 Difference]: Finished difference Result 2435 states and 2630 transitions. [2022-11-26 01:06:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 01:06:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 128 states have (on average 2.2578125) internal successors, (289), 131 states have internal predecessors, (289), 2 states have call successors, (2), 1 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 116 [2022-11-26 01:06:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:10,545 INFO L225 Difference]: With dead ends: 2435 [2022-11-26 01:06:10,545 INFO L226 Difference]: Without dead ends: 2435 [2022-11-26 01:06:10,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 206 SyntacticMatches, 25 SemanticMatches, 159 ConstructedPredicates, 131 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=428, Invalid=812, Unknown=154, NotChecked=24366, Total=25760 [2022-11-26 01:06:10,548 INFO L413 NwaCegarLoop]: 865 mSDtfsCounter, 4603 mSDsluCounter, 5010 mSDsCounter, 0 mSdLazyCounter, 8474 mSolverCounterSat, 76 mSolverCounterUnsat, 694 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 5875 SdHoareTripleChecker+Invalid, 262248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 8474 IncrementalHoareTripleChecker+Invalid, 694 IncrementalHoareTripleChecker+Unknown, 253004 IncrementalHoareTripleChecker+Unchecked, 38.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:10,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 5875 Invalid, 262248 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [76 Valid, 8474 Invalid, 694 Unknown, 253004 Unchecked, 38.3s Time] [2022-11-26 01:06:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2022-11-26 01:06:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1613. [2022-11-26 01:06:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1017 states have (on average 1.7256637168141593) internal successors, (1755), 1602 states have internal predecessors, (1755), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 01:06:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 1779 transitions. [2022-11-26 01:06:10,573 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 1779 transitions. Word has length 116 [2022-11-26 01:06:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:10,574 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 1779 transitions. [2022-11-26 01:06:10,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 128 states have (on average 2.2578125) internal successors, (289), 131 states have internal predecessors, (289), 2 states have call successors, (2), 1 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-26 01:06:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1779 transitions. [2022-11-26 01:06:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-26 01:06:10,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:10,576 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:06:10,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-26 01:06:10,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-26 01:06:11,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-26 01:06:11,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 01:06:11,194 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 01:06:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2088416094, now seen corresponding path program 1 times [2022-11-26 01:06:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:06:11,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235122696] [2022-11-26 01:06:11,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:11,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-26 01:06:11,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:06:11,196 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:06:11,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-26 01:06:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:12,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-26 01:06:12,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:06:12,536 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-26 01:06:12,853 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 01:06:12,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 01:06:12,912 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-26 01:06:13,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 01:06:13,266 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8934)))) is different from true [2022-11-26 01:06:13,295 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8935 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8935) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:06:13,325 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8936) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:06:13,436 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8938)))) is different from true [2022-11-26 01:06:13,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943)))) is different from true [2022-11-26 01:06:15,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_8962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8962)))) is different from true [2022-11-26 01:06:16,122 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:06:16,123 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-26 01:06:16,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:06:16,346 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-26 01:06:16,524 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:06:16,524 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-26 01:06:16,728 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:06:16,729 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-26 01:06:16,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 33 treesize of output 15 [2022-11-26 01:06:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-26 01:06:16,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:06:17,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8980) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-11-26 01:06:17,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 01:06:17,096 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 01:06:17,123 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 01:06:17,184 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:06:17,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:06:17,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9026))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:06:17,736 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:06:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235122696] [2022-11-26 01:06:17,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235122696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:06:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1150503770] [2022-11-26 01:06:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:06:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:06:17,738 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:06:17,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-26 01:07:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:29,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-26 01:07:29,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:29,156 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-26 01:07:29,496 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 01:07:29,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 01:07:29,531 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-26 01:07:29,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 01:07:30,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9431)))) is different from true [2022-11-26 01:07:30,577 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9433)))) is different from true [2022-11-26 01:07:30,674 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9435)))) is different from true [2022-11-26 01:07:30,770 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9437)))) is different from true [2022-11-26 01:07:31,338 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9446)))) is different from true [2022-11-26 01:07:32,166 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9461)))) is different from true [2022-11-26 01:07:32,446 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:32,446 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-26 01:07:32,580 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:32,581 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-26 01:07:32,684 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:32,685 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-26 01:07:32,782 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:32,783 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-26 01:07:32,822 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-26 01:07:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-26 01:07:32,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:34,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 01:07:35,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 01:07:35,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 01:07:35,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9465))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 01:07:35,127 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:07:35,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9513))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 01:07:35,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1150503770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:35,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967749202] [2022-11-26 01:07:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:35,669 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:35,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-26 01:07:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:36,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-26 01:07:36,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:36,962 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:07:36,963 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-26 01:07:37,042 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-26 01:07:37,366 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9906) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,381 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9907) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,395 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9908) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,410 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9909) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,424 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9910))) is different from true [2022-11-26 01:07:37,438 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9911))) is different from true [2022-11-26 01:07:37,453 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9912) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,466 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9913) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,478 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9914) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,489 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9915) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,501 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9916))) is different from true [2022-11-26 01:07:37,512 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9917))) is different from true [2022-11-26 01:07:37,524 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9918))) is different from true [2022-11-26 01:07:37,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9919))) is different from true [2022-11-26 01:07:37,547 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9920))) is different from true [2022-11-26 01:07:37,559 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9921))) is different from true [2022-11-26 01:07:37,571 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9922))) is different from true [2022-11-26 01:07:37,583 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9923))) is different from true [2022-11-26 01:07:37,596 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9924) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,607 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9925))) is different from true [2022-11-26 01:07:37,620 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9926))) is different from true [2022-11-26 01:07:37,631 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9927))) is different from true [2022-11-26 01:07:37,643 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9928))) is different from true [2022-11-26 01:07:37,655 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9929))) is different from true [2022-11-26 01:07:37,666 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9930))) is different from true [2022-11-26 01:07:37,678 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9931))) is different from true [2022-11-26 01:07:37,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9932) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,716 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9933))) is different from true [2022-11-26 01:07:37,731 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9934) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,746 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9935))) is different from true [2022-11-26 01:07:37,761 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9936))) is different from true [2022-11-26 01:07:37,776 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9937) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,790 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9938) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,805 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9939) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,820 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9940))) is different from true [2022-11-26 01:07:37,835 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9941) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,850 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9942))) is different from true [2022-11-26 01:07:37,865 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9943))) is different from true [2022-11-26 01:07:37,880 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9944))) is different from true [2022-11-26 01:07:37,895 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9945))) is different from true [2022-11-26 01:07:37,909 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9946) |c_#memory_$Pointer$.base|)) is different from true [2022-11-26 01:07:37,923 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9947))) is different from true [2022-11-26 01:07:37,938 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9948))) is different from true [2022-11-26 01:07:37,953 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9949))) is different from true [2022-11-26 01:07:38,019 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:38,019 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 23 treesize of output 26 [2022-11-26 01:07:38,221 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:38,221 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 23 treesize of output 26 [2022-11-26 01:07:38,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:38,412 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-26 01:07:38,753 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:38,753 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-26 01:07:38,786 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-26 01:07:38,794 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-26 01:07:38,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:38,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9952) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 01:07:38,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9952) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-26 01:07:38,901 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-26 01:07:38,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-26 01:07:38,917 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-11-26 01:07:38,936 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9951))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-26 01:07:38,968 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9950)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2022-11-26 01:07:38,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9950))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2022-11-26 01:07:39,505 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9998))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9950)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_9951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2022-11-26 01:07:39,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967749202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:39,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:39,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 56] total 77 [2022-11-26 01:07:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924388855] [2022-11-26 01:07:39,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:39,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-26 01:07:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:07:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-26 01:07:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=520, Unknown=97, NotChecked=9044, Total=9900 [2022-11-26 01:07:39,513 INFO L87 Difference]: Start difference. First operand 1613 states and 1779 transitions. Second operand has 78 states, 75 states have (on average 2.506666666666667) internal successors, (188), 78 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:07:41,750 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9435))) (exists ((v_ArrVal_9437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9437))) (exists ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9446))) (exists ((v_ArrVal_8962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8962))) (exists ((v_ArrVal_8938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8938))) (exists ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9461))) (exists ((v_ArrVal_8937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8937) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943))) (exists ((v_ArrVal_8935 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8935) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9433))) (exists ((v_ArrVal_9431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9431)))) is different from true [2022-11-26 01:07:41,759 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9435))) (exists ((v_ArrVal_9437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9437))) (exists ((v_ArrVal_9908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9908) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9446))) (exists ((v_ArrVal_8962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8962))) (exists ((v_ArrVal_8938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8938))) (exists ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9461))) (exists ((v_ArrVal_8937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8937) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943))) (exists ((v_ArrVal_8936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8936) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9433))) (exists ((v_ArrVal_9431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9431)))) is different from true [2022-11-26 01:07:41,767 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|) (_ bv1 1))) (not (= v_arrayElimCell_131 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_15|)) (= (bvadd (select |c_#valid| v_arrayElimCell_131) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_9435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9435))) (exists ((v_ArrVal_9437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9437))) (exists ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9446))) (exists ((v_ArrVal_8962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8962))) (exists ((v_ArrVal_9909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9909) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8938))) (exists ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9461))) (exists ((v_ArrVal_8937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8937) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8943))) (exists ((v_ArrVal_9433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9433))) (exists ((v_ArrVal_9431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9431)))) is different from true [2022-11-26 01:08:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:21,203 INFO L93 Difference]: Finished difference Result 2648 states and 2904 transitions. [2022-11-26 01:08:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-26 01:08:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 75 states have (on average 2.506666666666667) internal successors, (188), 78 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2022-11-26 01:08:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:21,212 INFO L225 Difference]: With dead ends: 2648 [2022-11-26 01:08:21,213 INFO L226 Difference]: Without dead ends: 2648 [2022-11-26 01:08:21,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 217 SyntacticMatches, 80 SemanticMatches, 111 ConstructedPredicates, 79 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=347, Invalid=981, Unknown=110, NotChecked=11218, Total=12656 [2022-11-26 01:08:21,214 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 3154 mSDsluCounter, 7823 mSDsCounter, 0 mSdLazyCounter, 7617 mSolverCounterSat, 69 mSolverCounterUnsat, 1214 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3167 SdHoareTripleChecker+Valid, 8732 SdHoareTripleChecker+Invalid, 94073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 7617 IncrementalHoareTripleChecker+Invalid, 1214 IncrementalHoareTripleChecker+Unknown, 85173 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:21,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3167 Valid, 8732 Invalid, 94073 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 7617 Invalid, 1214 Unknown, 85173 Unchecked, 40.1s Time] [2022-11-26 01:08:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-11-26 01:08:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1612. [2022-11-26 01:08:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1017 states have (on average 1.7246804326450345) internal successors, (1754), 1601 states have internal predecessors, (1754), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-26 01:08:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1778 transitions. [2022-11-26 01:08:21,241 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1778 transitions. Word has length 119 [2022-11-26 01:08:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:21,242 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 1778 transitions. [2022-11-26 01:08:21,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 75 states have (on average 2.506666666666667) internal successors, (188), 78 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:08:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1778 transitions. [2022-11-26 01:08:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-26 01:08:21,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:21,251 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:21,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:21,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:21,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:21,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 01:08:21,875 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 831 more)] === [2022-11-26 01:08:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2088416095, now seen corresponding path program 1 times [2022-11-26 01:08:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:08:21,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899728580] [2022-11-26 01:08:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:21,876 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-26 01:08:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:08:21,877 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:08:21,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-26 01:08:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:23,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-26 01:08:23,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:23,307 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-26 01:08:23,594 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 01:08:23,594 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-26 01:08:23,607 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-26 01:08:23,652 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-26 01:08:23,667 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-26 01:08:23,896 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-26 01:08:23,904 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-26 01:08:24,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10395 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10395))) (exists ((v_ArrVal_10396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10396) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,134 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10399))) (exists ((v_ArrVal_10400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10400) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,273 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10406) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10405)))) is different from true [2022-11-26 01:08:24,356 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10409))) (exists ((v_ArrVal_10410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10410)))) is different from true [2022-11-26 01:08:24,622 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10420))) (exists ((v_ArrVal_10419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10419) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10422))) (exists ((v_ArrVal_10421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10421) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,667 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10423) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10424)))) is different from true [2022-11-26 01:08:24,691 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10425))) (exists ((v_ArrVal_10426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10426))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,715 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10428))) (exists ((v_ArrVal_10427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10427)))) is different from true [2022-11-26 01:08:24,757 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10429 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10429) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10430)))) is different from true [2022-11-26 01:08:24,779 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10431) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10432) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:08:24,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10434))) (exists ((v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10433) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:08:24,823 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10435))) (exists ((v_ArrVal_10436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10436))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,845 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10437) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10438) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:08:24,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10439))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10440) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:08:24,891 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10441))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10442)))) is different from true [2022-11-26 01:08:24,914 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10443))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10444)))) is different from true [2022-11-26 01:08:24,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10445))) (exists ((v_ArrVal_10446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10446))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10448))) (exists ((v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10447))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:24,982 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10450))) (exists ((v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10449)))) is different from true [2022-11-26 01:08:25,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10452) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10451)))) is different from true [2022-11-26 01:08:25,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10454))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10453)))) is different from true [2022-11-26 01:08:25,054 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10456))) (exists ((v_ArrVal_10455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10455) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,077 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10458))) (exists ((v_ArrVal_10457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10457) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,101 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10460) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10459) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:08:25,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10461) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10462)))) is different from true [2022-11-26 01:08:25,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10464) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10463)))) is different from true [2022-11-26 01:08:25,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10466))) (exists ((v_ArrVal_10465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10465)))) is different from true [2022-11-26 01:08:25,193 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10468))) (exists ((v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10467) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,217 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10470))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10469) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 01:08:25,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10471) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,262 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10474))) (exists ((v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10473))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,284 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10476))) (exists ((v_ArrVal_10475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10475) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,306 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10477) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:08:25,334 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10480))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32))) (exists ((v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10479) |c_#memory_$Pointer$.base|))) is different from true [2022-11-26 01:08:25,361 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10482))) (exists ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10481))) (exists ((v_arrayElimCell_156 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_156) (_ bv44 32)))) is different from true [2022-11-26 01:08:25,436 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:08:25,436 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-26 01:08:25,456 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-26 01:08:25,679 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:08:25,680 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-26 01:08:25,700 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-26 01:08:25,883 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:08:25,883 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-26 01:08:25,905 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-26 01:08:26,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:08:26,095 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-26 01:08:26,104 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-26 01:08:26,158 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-26 01:08:26,166 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-26 01:08:26,245 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-26 01:08:26,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:26,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2022-11-26 01:08:26,621 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_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2022-11-26 01:08:26,703 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10486))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10485) .cse2 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-26 01:08:26,772 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_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10485) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10486))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10485) .cse3 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-26 01:08:28,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10484))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10483) .cse1 v_ArrVal_10485) (select (select (store .cse2 .cse1 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10487))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10484))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10486))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10483) .cse4 v_ArrVal_10485) .cse5 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 01:08:30,572 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) .cse2 v_ArrVal_10485) (select (select (store .cse3 .cse2 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10487))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10486))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) .cse5 v_ArrVal_10485) .cse6 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2022-11-26 01:08:34,378 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10579))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10484))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10486))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10580) .cse0 v_ArrVal_10483) .cse1 v_ArrVal_10485) .cse2 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10488) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10579))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10484))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10580) .cse8 v_ArrVal_10483) .cse9 v_ArrVal_10485) (select (select (store .cse10 .cse9 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10487))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2022-11-26 01:08:34,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:08:34,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899728580] [2022-11-26 01:08:34,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899728580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:34,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2029302314] [2022-11-26 01:08:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:34,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:08:34,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:08:34,409 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:08:34,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425f79c0-56b4-4549-be17-8d441e9fe6e5/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process